{"arxiv_id":"2611.16518","title":"Counting Triangulated 3-Spheres, Nuclei, and Polyhedra","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.","primary_cat":"math.CO","cross_cats":[],"submitted_at":"2026-11-12T09:16:11+00:00","latest_version":1,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":"ACCEPT","confidence":"HIGH","one_line_summary":"The exponential boundedness of triangulated 3-spheres, nuclei, one-vertex generalized triangulations, and special spines of the 3-ball are all equivalent problems.","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","upvotes":0,"downvotes":0,"pith_score":0,"inbound_count":0,"_links":{"html":"https://pith.science/paper/2611.16518","verdict":"/api/v1/verdicts/2611.16518"}}