Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.18197v2

Help | Advanced Search

Computer Science > Computational Geometry

arXiv:2510.18197v2 (cs)
[Submitted on 21 Oct 2025 (v1) , last revised 22 Oct 2025 (this version, v2)]

Title: Bounding the number of holes required for folding rectangular polyominoes into cubes

Title: 限定折叠矩形多米诺 into 立方体所需的孔数

Authors:Florian Lehner, Benjamin Shirley
Abstract: 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.
Abstract: 我们研究了带有孔的矩形多米诺骨牌是否可以折叠成一个立方体的问题,即仅允许沿网格线折叠时,它们是否可以折叠成一个立方体。 已知足够大的孔可以保证这一点。 单独本身不能使矩形多米诺骨牌可折叠成立方体的较小孔有时可以组合起来创建可折叠成立方体的多米诺骨牌。 我们研究了保证可折叠性的最小孔集。 我们证明,如果所有孔类型相同,这些最小集合的大小最多为4,而如果我们允许不同类型的孔,则没有大小上限。
Subjects: Computational Geometry (cs.CG) ; Combinatorics (math.CO)
Cite as: arXiv:2510.18197 [cs.CG]
  (or arXiv:2510.18197v2 [cs.CG] for this version)
  https://doi.org/10.48550/arXiv.2510.18197
arXiv-issued DOI via DataCite

Submission history

From: Florian Lehner [view email]
[v1] Tue, 21 Oct 2025 00:47:43 UTC (23 KB)
[v2] Wed, 22 Oct 2025 03:26:47 UTC (23 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.CG
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号