{"paper":{"title":"Trees of nuclei and bounds on the number of triangulations of the 3-ball","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GT","math.MP"],"primary_cat":"math-ph","authors_text":"Jean-Pierre Eckmann, Maher Younan, Pierre Collet","submitted_at":"2012-04-27T10:06:23Z","abstract_excerpt":"Based on the work of Durhuus-J{\\'o}nsson and Benedetti-Ziegler, we revisit the question of the number of triangulations of the 3-ball. We introduce a notion of nucleus (a triangulation of the 3-ball without internal nodes, and with each internal face having at most 1 external edge). We show that every triangulation can be built from trees of nuclei. This leads to a new reformulation of Gromov's question: We show that if the number of rooted nuclei with $t$ tetrahedra has a bound of the form $C^t$, then the number of rooted triangulations with $t$ tetrahedra is bounded by $C_*^t$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6161","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}