Counting Triangulated 3-Spheres, Nuclei, and Polyhedra
We exploit two-dimensional dual polyhedra to study triangulated $3$-spheres and nuclei. First, we show that the long-standing open problem of whether the number of triangulated $3$-spheres is exponentially bounded is equivalent to the corresponding problem for one-vertex generalized triangulations, and hence also for special spines of the $3$-ball. This also establishes an equivalent counting problem for nuclei. Second, we investigate properties of nuclei, including their dual polyhedra. We also prove that every nontrivial nucleus contains a tetrahedron with six interior edges, identify the unique vertex-minimal nontrivial nucleus with $11$ vertices and $35$ tetrahedra, and construct nuclei whose dual graphs have genus growing linearly with the number of tetrahedra.
Authors
- Bergfinnur Durhuus (ORCID: https://orcid.org/0000-0002-0450-6792)
- Marta Pavelka (ORCID: https://orcid.org/0009-0007-0827-4291)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16518
- Primary Topic
- Geometric and Algebraic Topology
- Type
- preprint