2020/12/11 by Kristin DeSplinter, Satyan L. Devadoss, Jordan Readyhough +1 · 1 voice
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry and Mesh Generation #Geometric and Algebraic Topology
paper · pdf · doi:10.37236/9796
openalex publication_date 2020/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that every ridge unfolding of an n-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the bounding boxes of these cube nets are classified using integer partitions, as well as the combinatorics of path unfoldings seen through the lens of chord diagrams.