Modular links: bunch algorithm and upper volume bounds
Algebraic & Geometric Topology · 22.06.2026 · 26 (6) · 2123-2156
DOI: 10.2140/agt.2026.26.2123 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic & Geometric Topology, online erschienen am 22.06.2026. Verfasst von Connie On Yu Hui und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben.
Abstract (Originalsprache)
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry of modular links and Lorenz links. Using the machinery developed for the bunch algorithm, we provide the first upper volume bound that is independent of word exponents and quadratic in the braid index of the Lorenz link component for all modular link complements. We find families of modular knot complements with upper volume bounds that are linear in the braid index. A classification of modular link complements based on the relative magnitudes of word exponents is also presented.
Zitieren
APA
Hui, C. O. Y., & Migueles, J. A. R. (2026). Modular links: bunch algorithm and upper volume bounds. Algebraic & Geometric Topology, 26(6), 2123-2156. https://doi.org/10.2140/agt.2026.26.2123
Vancouver
Hui COY, Migueles JAR. Modular links: bunch algorithm and upper volume bounds. Algebraic & Geometric Topology. 2026;26(6):2123-2156. doi:10.2140/agt.2026.26.2123
BibTeX
@article{Hui2026,
author = {Hui, Connie On Yu and Migueles, José Andrés Rodríguez},
title = {Modular links: bunch algorithm and upper volume bounds},
journal = {Algebraic & Geometric Topology},
year = {2026},
volume = {26},
number = {6},
pages = {2123--2156},
doi = {10.2140/agt.2026.26.2123}
}
EUVIMED