Mathematics > Geometric Topology
[Submitted on 23 Mar 2025
]
Title: On a family of hyperbolic Brunnian links and their volumes
Title: 关于一类双曲布伦尼亚链环及其体积
Abstract: An $n$-component link $L$ is said to be \emph{Brunnian} if it is non-trivial but every proper sublink of $L$ is trivial. The simplest and best known example of a hyperbolic Brunnian link is the 3-component link known as "Borromean rings". For $n\geq 2,$ we introduce an infinite family of $n$-component Brunnian links with positive integer parameters $Br(k_1, \ldots, k_n)$ that generalize examples constructed by Debrunner in 1964. We are interested in hyperbolic invariants of 3-manifolds $S^3 \setminus Br(k_1, \ldots, k_n)$ and we obtain upper bounds for their volumes. Our approach is based on Dehn fillings on cusped manifolds with volumes related to volumes of ideal right-angled hyperbolic antiprisms.
Current browse context:
math.GT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.