Cutting a Pancake with an Exotic Knife
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913044285620224 |
|---|---|
| author | Cutler, David O. H. Karlsson, Jonas Sloane, Neil J. A. |
| author_facet | Cutler, David O. H. Karlsson, Jonas Sloane, Neil J. A. |
| contents | In the first chapter of their classic book "Concrete Mathematics", Graham, Knuth, and Patashnik consider the maximum number of pieces that can be obtained from a pancake by making n cuts with a knife blade that is straight, or bent into a V, or bent twice into a Z. We extend their work by considering knives, or "cookie-cutters", of even more exotic shapes, including a k-armed V, a chain of k connected line segments, long-legged versions of the letters A, E, H, L, M, T, W, or X, a convex polygon, a circle, a phi, a figure 8, a pentagram, a hexagram, or a lollipop (or qoppa). We also consider "constrained" versions of the long-legged letters A, H, L, T, and X. In most cases we are able to determine the maximum number of pieces, although for the constrained A and the lollipop we can only give bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_15864 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cutting a Pancake with an Exotic Knife Cutler, David O. H. Karlsson, Jonas Sloane, Neil J. A. Combinatorics Primary 05C10, Secondary 05C63, 52C30 In the first chapter of their classic book "Concrete Mathematics", Graham, Knuth, and Patashnik consider the maximum number of pieces that can be obtained from a pancake by making n cuts with a knife blade that is straight, or bent into a V, or bent twice into a Z. We extend their work by considering knives, or "cookie-cutters", of even more exotic shapes, including a k-armed V, a chain of k connected line segments, long-legged versions of the letters A, E, H, L, M, T, W, or X, a convex polygon, a circle, a phi, a figure 8, a pentagram, a hexagram, or a lollipop (or qoppa). We also consider "constrained" versions of the long-legged letters A, H, L, T, and X. In most cases we are able to determine the maximum number of pieces, although for the constrained A and the lollipop we can only give bounds. |
| title | Cutting a Pancake with an Exotic Knife |
| topic | Combinatorics Primary 05C10, Secondary 05C63, 52C30 |
| url | https://arxiv.org/abs/2511.15864 |