# Hypercake Number

Cake number, as defined in mathematics is the number of maximum pieces a cake can be cut into with a given number of cuts. In this post, we will try to do the same with a cake (a hypercake if you may) in higher dimensions.

## The Knife’s Dimension

Before we move on to cutting cakes, let’s ponder upon the dimension of the knife. What should be the dimension of the knife when cutting a multidimensional cake?

• For a regular cake ($3$D), we use a regular knife (a $2$D plane).
• For a cutting pancake ($2$D), we use a regular knife ($2$D). We can even use a razor-thin string ($1$D) as well to cut the pancake.
• For cutting a candy stick($1$D), we can use a knife, a garrote, and even a point ($0$D).

Would it be safe to say that we can cut an $n$-dimensional cake if we have a slicer of at least $(n-1)$ dimension?

• If using an $(n-1)$D slicer to cut an $n$D cake, the slicer must lie in the same dimension as that of the cake.
• If using an $\geq n$D slicer to cut an $n$D cake, the slicer must not be parallel to the cake.

Moving on to the main problem let $c_{m,n}$ represents the number of maximum slices with $m$ as the cake’s dimension and $n$ as the number of cuts. For the sake of simplicity, we will take a slicer of $(m-1)$ dimension to slice the $m$-dimensional cake.

## The Pancake Problem

Starting with a pancake (a $2$D cake) and a $1$D slicer (a line), the first line cuts the plane into $2$ pieces. For $n > 1$, the $n$-th line crosses every earlier line and also avoids every previous line intersection and parallelism, thus increasing the number of pieces by $n$. So this leads to a recurring relation1:

where $c_{2,n}$ represent the number of maximum pieces obtained with $n$ cuts with $c_{2,1} = 2$.

Solving the above series2, we obtain:

Note: $\binom{n}{r} = \frac{n!}{(n-r)!\times r!}$ and for $% $, $\binom{n}{r} = 0$

## The Cake Problem

Now do the same for a regular cake ($3$D) with a knife ($2$D plane), we have to make each cut (plane) such that it is not parallel to any of the existing cuts (planes) and slices each one of them.

One way to visualize this would be to view the lines of intersection between all existing planes and the incoming plane. On the incoming plane, these lines will represent the cuts that yield the maximum number of slices in the plane dimension3.

From the pancake problem, we can say that the plane is sliced into $c_{2,n-1}$ pieces assuming $n-1$ planes already exist. This represents the number of new slices created after $n$th cut4.

with $c_{3,1} = 2$. Solving above recurrence we have5:

Revisiting our pancake problem, we have:

Here $c_{1,n-1} = n$ is clearly the number of pieces obtained after $n-1$ cuts on a line.

## The Hypercake Problem

The above method can be extended to cakes in higher dimension but the visualization gets difficult. We have math to do that for us. Generalizing we can write:

with $c_{m,1} = 2$ and $c_{1,m} = m+1$.

Using the same method, suppose $n-1$ $(m-1)$D-hyperplanes are already cutting the $m$-D hypercake. The incoming $(m-1)$D-hyperplane will intersect with the existing $(m-1)$D-hyperplanes in $(m-2)$D-hyperplanes which create $c_{m-1,n-1}$ new slices6.

From the previous series …

… it seems that the hypercake series will unfold to7

Also, when $m \to \infty$

1. Hint: Sum of first n positive integers = $\frac{n(n+1)}{2}$

2. Suggested Reading: Hyperspace - Michio Kaku

3. Hint: Sum of squares of first n positive integers = $\frac{n(n+1)(2n+1)}{6}$

4. Take a shot everytime hyper is mentioned.

5. Read next: Deriving the hypercake series