Bounding the number of holes required for folding rectangular polyominoes into cubes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917031636369408 |
|---|---|
| author | Lehner, Florian Shirley, Benjamin |
| author_facet | Lehner, Florian Shirley, Benjamin |
| contents | We study the problem of whether rectangular polyominoes with holes are cube-foldable, that is, whether they can be folded into a cube, if creases are only allowed along grid lines. It is known that holes of sufficient size guarantee that this is the case.
Smaller holes which by themselves do not make a rectangular polyomino cube-foldable can sometimes be combined to create cube-foldable polyominoes. We investigate minimal sets of holes which guarantee cube-foldability. We show that if all holes are of the same type, the these minimal sets have size at most 4, and if we allow different types of holes, then there is no upper bound on the size. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_18197 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounding the number of holes required for folding rectangular polyominoes into cubes Lehner, Florian Shirley, Benjamin Computational Geometry Combinatorics We study the problem of whether rectangular polyominoes with holes are cube-foldable, that is, whether they can be folded into a cube, if creases are only allowed along grid lines. It is known that holes of sufficient size guarantee that this is the case. Smaller holes which by themselves do not make a rectangular polyomino cube-foldable can sometimes be combined to create cube-foldable polyominoes. We investigate minimal sets of holes which guarantee cube-foldability. We show that if all holes are of the same type, the these minimal sets have size at most 4, and if we allow different types of holes, then there is no upper bound on the size. |
| title | Bounding the number of holes required for folding rectangular polyominoes into cubes |
| topic | Computational Geometry Combinatorics |
| url | https://arxiv.org/abs/2510.18197 |