Complexity of 3-manifolds obtained by Dehn filling
William Jaco, J. Hyam Rubinstein, Jonathan Spreer, Stephan Tillmann

TL;DR
This paper develops bounds for the complexity of 3-manifolds obtained by Dehn filling, providing methods to estimate their complexity with small gaps, and applies these to specific knot complements.
Contribution
It introduces a new approach to estimate the complexity of Dehn filled 3-manifolds with explicit bounds depending on triangulation size.
Findings
Bounds on complexity of Dehn filled manifolds are established.
Method applied successfully to knot complements like figure eight and pretzel knots.
Complexity gaps are minimized to at most 10 for several families.
Abstract
Let be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of As an application, we characterise some infinite families of even Dehn fillings of for which our method determines the complexity of its members up to an additive constant. The constant only depends on the size of a chosen triangulation of , and the isotopy class of its boundary. We then show that, given a triangulation of with --triangle torus boundary, there exist infinite families of even Dehn fillings of for which we can determine the complexity of the filled manifolds with a gap between upper and lower bound of at most This result is bootstrapped to obtain the gap as a function of the size of an ideal triangulation of the interior of , or the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics
