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

DOI10.1007/S00220-013-1859-YMaRDI QIDQ393706zbMATH OpenOpenAlexFDO

Authors P. Collet, Jean-Pierre Eckmann, M. Younan

Publication date 24 January 2014

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.6161

zbMATH Keywords

triangulated \(3\)-balls

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral manifolds (52B70) Triangulating manifolds (57Q15)

Abstract: 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_{\ast }^t$.

Review text

A difficult (and still open) question in topological combinatorics is the following: does there exist a constant \(c\) such that the number of combinatorially distinct triangulations of the \(3\)-sphere is bounded from above by \(c^n\), where \(n\) is the number of tetrahedra? The same question, where \(n\) is the number of vertices, was answered negatively by \textit{J. Pfeifle} and \textit{G. M. Ziegler} [Math. Ann. 330, No. 4, 829--837 (2004; Zbl 1062.52011)]. An upper bound on the number of spheres also yields an upper bound for the number of balls of the same dimension (e.g., from removing one facet). The authors of the paper under review study a specific method to construct triangulated \(3\)-dimensional balls. As their main result they show that the number of these special triangulations indeed has a single exponential upper bound.

Recommendations

• On the number of intersections of three monochromatic trees in the plane
• Combinatorics of tripartite boundary connections for trees and dimers
• 3-trees in polyhedral maps
• scientific article; zbMATH DE number 5523
• scientific article; zbMATH DE number 15360
• The \(p\)-bondage number of trees
• scientific article; zbMATH DE number 1122698
• On counting triangulations in d dimensions

Cites work

• A Census of Planar Triangulations
• A topological glass
• Glass transition in self-organizing cellular patterns
• Graph theory
• scientific article; zbMATH DE number 1645816 (Why is no real title available?)
• scientific article; zbMATH DE number 3287446 (Why is no real title available?)
• Many triangulated 3-spheres
• On locally constructible spheres and balls
• Quantum Geometry
• Remarks on the entropy of 3-manifolds
• Three-dimensional simplicial quantum gravity and generalized matrix models

Cited in

(10)

• Many triangulated spheres
• Remarks on the entropy of 3-manifolds
• On a triangulation of the \(3\)-ball and the solid torus
• Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
• On the number of coloured triangulations of \(d\)-manifolds
• Exponential bounds on the number of causal triangulations
• Mogami manifolds, nuclei, and 3D simplicial gravity
• Deciding constructibility of 3-balls with at most two interior vertices
• Many triangulated 3-spheres
• A Cheeger-type exponential bound for the number of triangulated manifolds

Describes a project that uses

Uses Software

• Simplicial complex library

This page was built for publication: Trees of nuclei and bounds on the number of triangulations of the 3-ball

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393706)