On the complexity of 2-bridge link complements
James Morgan, Jonathan Spreer
TL;DR
The paper addresses the complexity of hyperbolic 2-bridge link complements by leveraging Sakuma–Weeks triangulations and angle-structure techniques to link hyperbolic volume to minimal triangulations. It re-establishes a fundamental non-minimality condition for these triangulations and, for links meeting the condition, constructs explicit angle structures to obtain lower bounds on complexity from volume, yielding multiplicative and additive bounds that improve on prior estimates. The analysis introduces a block-decomposition framework for the 2-bridge words, assigns shapes to tetrahedra to maximize volume within gluing constraints, and derives bounds such as c(M) 0.8|T| with refined additive bounds expressed in terms of syllable structure, while also comparing to existing volume-based bounds. Overall, the work clarifies when Sakuma–Weeks triangulations are minimal and provides practical, sharp lower bounds on the complexity of an infinite family of 2-bridge link complements. The results have implications for computational topology and the understanding of how combinatorial triangulations encode hyperbolic geometry in 3-manifolds.
Abstract
We reprove a necessary condition for the Sakuma-Weeks triangulation of a 2-bridge link complement to be minimal in terms of the mapping class describing its alternating 4-string braid construction. For the 2-bridge links satisfying this condition we construct explicit angle structures on the Sakuma-Weeks triangulations and compute both multiplicative and additive lower bounds on the complexity of the link complements via volume estimates. These lower bounds are an improvement on existing volume estimates for the 2-bridge links examined.
