Unfoldings of the Cube

Richard Goldstone; Robert Suzzi Valli

Home/Archive/arXiv

arXiv · 1604.05004

Unfoldings of the Cube

Richard Goldstone·Robert Suzzi Valli

View original source ↗Read source document ↗Export metadata ↓

Abstract

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges. This dual perspective invites an interplay of geometric, algebraic, and combinatorial techniques. The initial observation is that a cutting pattern which unfolds the cubical surface corresponds to a spanning tree of the cube graph. The Matrix-Tree theorem can be used to calculate the number of spanning trees in a connected graph, and thus allows us to compute the number of ways to unfold the cube. Since two or more spanning trees may yield the same unfolding shape, Burnside's lemma is required to count the number of incongruent unfoldings. Such a count can be an arduous task. Here we employ a combination of elementary algebraic and geometric techniques to bring the problem within the range of simple hand calculations.

Explore related subjects

math.GR math.CO

Keep this discovery

BibTeX RIS

Richard Goldstone, Robert Suzzi Valli. 2016-04-18. Unfoldings of the Cube. https://arxiv.org/abs/1604.05004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗

arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗

arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗