Type
ArticleAuthors
Skopenkov, MikhailKAUST Department
Visual Computing Center (VCC)Date
2011-06-13Preprint Posting Date
2010-03-10Online Publication Date
2011-06-13Print Publication Date
2011Permanent link to this record
http://hdl.handle.net/10754/561765
Metadata
Show full item recordAbstract
Given a triangular cake and a box in the shape of its mirror image, how can the cake be cut into a minimal number of pieces so that it can be put into the box? The cake has icing, so we are not allowed to put it into the box upside down. V. G. Boltyansky asked this question in 1977 and showed that three pieces always suffice. In this paper we provide examples of cakes that cannot be cut into two pieces to be put into the box. This shows that three is the answer to Boltyansky's question. We also give examples of cakes which can be cut into two pieces. © THE MATHEMATICAL ASSOCIATION OF AMERICA.Citation
M. Skopenkov. (2011). Packing a Cake into a Box. The American Mathematical Monthly, 118(5), 424. doi:10.4169/amer.math.monthly.118.05.424Sponsors
The author is grateful to R. Clawson, B. R. Frenkin, A. A. Glazyrin, I. V. Izmestiev, and M. V. Prasolov for useful discussions. The author is also grateful to his wife Anastasia for some figures and cakes. The author was supported in part by the Moebius Contest Foundation for Young Scientists and the Euler Foundation.Publisher
Informa UK LimitedarXiv
1003.2101Additional Links
http://arxiv.org/abs/arXiv:1003.2101v1ae974a485f413a2113503eed53cd6c53
10.4169/amer.math.monthly.118.05.424