Trees of nuclei and bounds on the number of triangulations of the 3-ball

preprint2012arXivOpen access

Abstract

Based on the work of Durhuus-J{ó}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 tt tetrahedra has a bound of the form CtC^t, then the number of rooted triangulations with tt tetrahedra is bounded by C∗tC_*^t.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.