Back to Search
Start Over
Sur la largeur arborescente linéaire des 3-variétés hyperboliques
- Source :
- Computing in Geometry and Topology, Computing in Geometry and Topology, 2022, 1 (1), pp.1:1-1:19. ⟨10.57717/cgt.v1i1.4⟩
- Publication Year :
- 2021
- Publisher :
- arXiv, 2021.
-
Abstract
- According to Mostow's celebrated rigidity theorem, the geometry of closed hyperbolic 3-manifolds is already determined by their topology. In particular, the volume of such manifolds is a topological invariant and, as such, has been subject of investigations for half a century. Motivated by the algorithmic study of 3-manifolds, Maria and Purcell have recently shown that every closed hyperbolic 3-manifold M with volume vol(M) admits a triangulation with dual graph of treewidth at most C vol(M), for some universal constant C. Here we improve on this result by showing that the volume provides a linear upper bound even on the pathwidth of the dual graph of some triangulation, which can potentially be much larger than the treewidth. Our proof relies on a synthesis of tools from 3-manifold theory: generalized Heegaard splittings, amalgamations, and the thick-thin decomposition of hyperbolic 3-manifolds. We provide an illustrated exposition of this toolbox and also discuss the algorithmic consequences of the result.<br />Computing in Geometry and Topology, Vol. 1 No. 1 (2022)
- Subjects :
- complexité paramétrée
Computational Geometry (cs.CG)
FOS: Computer and information sciences
topologie algorithmique des 3-variétés
largeur arborescente linéaire
largeur arborescente
G.2.2
[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
computational 3-manifold topology
MSC 57Q15, 57N10, 05C75, 57M15
Mathematics - Geometric Topology
divisions de Heegaard généralisées
[MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT]
solubilité à paramètre fixé
thick-thin decomposition
treewidth
FOS: Mathematics
F.2.2
volume
generalized Heegaard splittings
hyperbolic 3-manifolds
3-variétés hyperboliques
57Q15, 57N10, 05C75, 57M15
pathwidth
Geometric Topology (math.GT)
décomposition épaisse-fine
Mathematics::Geometric Topology
ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory
ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems
fixed-parameter tractability
Computer Science - Computational Geometry
Subjects
Details
- ISSN :
- 27507823
- Database :
- OpenAIRE
- Journal :
- Computing in Geometry and Topology, Computing in Geometry and Topology, 2022, 1 (1), pp.1:1-1:19. ⟨10.57717/cgt.v1i1.4⟩
- Accession number :
- edsair.doi.dedup.....fffff15b86719260c7b4a287af11c440
- Full Text :
- https://doi.org/10.48550/arxiv.2105.11371