The Braid Indices of Pretzel Links: A Comprehensive Study, Part I

Yuanan Diao; Claus Ernst; Gabor Hetyei

Home/Archive/arXiv

arXiv · 2403.14094

The Braid Indices of Pretzel Links: A Comprehensive Study, Part I

Yuanan Diao·Claus Ernst·Gabor Hetyei

View original source ↗Read source document ↗Export metadata ↓

Abstract

The determination of the braid index of an oriented link is generally a hard problem. In the case of alternating links, some significant progresses have been made in recent years which made explicit and precise braid index computations possible for links from various families of alternating links, including the family of all alternating Montesinos links. However, much less is known for non-alternating links. For example, even for the non-alternating pretzel links, which are special (and simpler) Montesinos links, the braid index is only known for a very limited few special cases. In this paper and its sequel, we study the braid indices for all non-alternating pretzel links by a systematic approach. We classify the pretzel links into three different types according to the Seifert circle decompositions of their standard link diagrams. More specifically, if $D$ is a standard diagram of an oriented pretzel link $\mathcal{L}$, $S(D)$ is the Seifert circle decomposition of $D$, and $C_1$, $C_2$ are the Seifert circles in $S(D)$ containing the top and bottom long strands of $D$ respectively, then $\mathcal{L}$ is classified as a Type 1 (Type 2) pretzel link if $C_1\not=C_2$ and $C_1$, $C_2$ have different (identical) orientations. In the case that $C_1=C_2$, then $\mathcal{L}$ is classified as a Type 3 pretzel link. In this paper, we present the results of our study on Type 1 and Type 2 pretzel links. Our results allow us to determine the precise braid index for any non-alternating Type 1 or Type 2 pretzel link. Since the braid indices are already known for all alternating pretzel links from our previous work, it means that we have now completely determined the braid indices for all Type 1 and Type 2 pretzel links.

Explore related subjects

math.GT math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yuanan Diao, Claus Ernst, Gabor Hetyei. 2024-03-21. The Braid Indices of Pretzel Links: A Comprehensive Study, Part I. https://arxiv.org/abs/2403.14094

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hyperbolic links associated to Hamiltonian subgraphs in simple $3$-polytopes

We build a large family of hyperbolic links with an explicit decomposition of the complement into right-angled hyperbolic polytopes of finite volume. Namely, in a series of papers A.D.Mednykn and A.Yu.Vesnin introduced a construction that for a given right-angled polytope $P$ in geometry $\mathbb L^3$, $\mathbb R^3$, $\mathbb S^3$, $\mathbb L^2\times \mathbb R$, $\mathbb S^2\times \mathbb R$ and a Hamiltonian cycle, theta-subgraph or $K_4$-subgraph $Γ$ in the $1$-skeleton of $P$ builds a geometric $3$-manifold $N(P,Γ)$ with an involution $τ$ such that $N(P,Γ)/\langleτ\rangle\simeq S^3$. The brach set of the corresponding $2$-sheeted branched covering $N(P,Γ)\to S^3$ is a link $C_Γ\subset S^3$ consisting of trivially embedded circles. This construction reformulated in the language of toric topology works for such a subgraph $Γ$ in any simple $3$-polytope $P$ and gives a topological $3$-manifold $N(P,Γ)$. We give a criterion when $S^3\setminus C_Γ$ has a complete hyperbolic structure of finite volume and generalize this criterion to similar links in $3$-manifolds different from $S^3$. We prove that hyperbolic links $C_Γ$ are parametrized by nonselfcrossing Eulerian cycles, Eulerian theta-subgraphs and Eulerian $K_4$-subgraphs in hyperbolic right-angled $3$-polytopes of finite volume in $\mathbb L^3$ with $0$, $2$ or $4$ finite vertices. The complement $S^3\setminus C_Γ$ is glued of $4$, $8$ or $16$ copies of the corresponding right-angled polytope. We give a criterion when the link $C_Γ$ consists of mutually unlinked circles and prove that if such a link is nontrivial, then it contains the Borromean rings. The latter problem is motivated by the Efimov effect in quantum mechanics.

math.GT↗

arXiv2026

Knots and the Sierpinski Tetrahedron

In this paper we prove that there are infinitely many knots that cannot be embedded in the 1-skeletons of the finite iterations of the Sierpinski tetrahedron fractal. We do this by proving that such an embedding induces a sphere decomposition of weight at most 6. There are infinitely many knots with spherewidth greater than this.