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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Counting Triangulated 3-Spheres, Nuclei, and Polyhedra

Bergfinnur Durhuus, Marta Pavelka
arXiv (Cornell University)
Geometric and Algebraic Topology
preprint

Counting Triangulated 3-Spheres, Nuclei, and Polyhedra

Bergfinnur Durhuus, Marta Pavelka
preprint en

Abstract

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.

arXiv (Cornell University)
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon