We give a general procedure that provides, given any particular pretzel link, a braid whose closure is the pretzel link. Moreover, we manage to give a specific braid word in terms of the entries of the pretzel link.
There are infinitely many pretzel links with the same Alexander polynomial (actually with trivial Alexander polynomial). By contrast, in this note we revisit the Jones polynomial of pretzel links and prove that, given a natural number S, there is only a finite number of pretzel links whose Jones polynomials have span S. More concretely, we provide an algorithm useful for deciding whether or not a given knot is pretzel. As an application we identify all the pretzel knots up to nine crossings, proving in particular that $8_{12}$ is the first non-pretzel knot.
The colored $\mathfrak{sl}_{3}$ Jones polynomial $J_{(n_{1}, n_{2})}^{\mathfrak{sl}_{3}}(L;q)$ are given by a link and an $(n_{1}, n_{2})$-irreducible representation of $\mathfrak{sl}_{3}$. In general, it is hard to calculate $J_{(n_{1}, n_{2})}^{\mathfrak{sl}_{3}}(L;q)$ for an oriented link $L$. However, we calculate the one-row $\mathfrak{sl}_{3}$ colored Jones polynomials $J_{(n, 0)}^{\mathfrak{sl}_{3}}(P(α,β,γ);q)$ for three-parameter families of oriented pretzel links $P(α,β,γ)$ by using Kuperberg's linear skein theory by setting $n_{2}=0$. Furthermore, we show the existence of the tails …
This paper examines number theoretic and topological properties of fully augmented pretzel link complements. In particular, we determine exactly when these link complements are arithmetic and exactly which are commensurable with one another. We show these link complements realize infinitely many CM-fields as invariant trace fields, which we explicitly compute. Further, we construct two infinite families of non-arithmetic fully augmented link complements: one that has no hidden symmetries and the other where the number of hidden symmetries grows linearly with volume. This second family realizes…
We investigate some algebraic structures called quasi-trivial quandles and we use them to study link-homotopy of pretzel links. Precisely, a necessary and sufficient condition for a pretzel link with at least two components being trivial under link-homotopy is given. We also generalize the quasi-trivial quandle idea to the case of biquandles and consider enhancement of the quasi-trivial biquandle cocycle counting invariant by quasi-trivial biquandle cocycles, obtaining invariants of link-homotopy type of links analogous to the quasi-trivial quandle cocycle invariants in Ayumu Inoue's article a…
We investigate the problem of characterising the family of strongly quasipositive links which have definite symmetrised Seifert forms and apply our results to the problem of determining when such a link can have an L-space cyclic branched cover. In particular, we show that if $δ_n = σ_1 σ_2 \ldots σ_{n-1}$ is the dual Garside element and $b = δ_n^k P \in B_n$ is a strongly quasipositive braid whose braid closure $\widehat b$ is definite, then $k \geq 2$ implies that $\widehat b$ is one of the torus links $T(2, q), T(3,4), T(3,5)$ or pretzel links $P(-2, 2, m), P(-2,3,4)$. Applying Theorem 1.1 …
We give an alternate expansion of the colored Jones polynomial of pretzel links which recovers the degree formula in arXiv:1807.00957. As an application, we determine the degrees of the colored Jones polynomials of a new family of 3-tangle pretzel knots.
We consider the group of unrestricted virtual braids, describe its structure and explore its relations with fused links. Also, we define the groups of flat virtual braids and virtual Gauss braids and study some of their properties, in particular their linearity.
Extended welded links are a generalization of Fenn, Rimányi, and Rourke's welded links. Their braided counterpart are extended welded braids, which are closely related to ribbon braids and loop braids. In this paper we prove versions of Alexander and Markov's theorems for extended welded braids and links, following Kamada's approach to the case of welded objects.
For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split factors, and the number of prime factors. Our results give improvements of known results for Conway and Jones polynomial of positive braid links. In Appendix, we present a simpler proof of theorem of Cromwell, a positive braid diagram represent composite link if and only if the the diagram is composite.
It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known Morton-Frank-Williams inequality reveals a close relationship between the HOMFLY polynomial of a link and its braid index. In the case that a link is already presented in a closed braid form, Jaeger derived a special formulation of the HOMFLY polynomial. In this paper, we prove a variant of Jaeger's result as well as a dual version of it. Unlike Jaeger's original reasoning, whi…
Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer generators.
It is well known that the braid index of a link equals the minimum number of Seifert circles among all link diagrams representing it. For a link with a reduced alternating diagram $D$, $s(D)$, the number of Seifert circles in $D$, equals the braid index $\textbf{b}(D)$ of $D$ if $D$ contains no {\em lone crossings} (a crossing in $D$ is called a {\em lone crossing} if it is the only crossing between two Seifert circles in $D$). If $D$ contains lone crossings, then $\textbf{b}(D)$ is strictly less than $s(D)$. However in general it is not known how $s(D)$ is related to $\textbf{b}(D)$. In this …
We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link $K$ in a contact 3-manifold $(M,ξ)$ is non-loose if and only if every braid representative of $K$ with respect to every open book decomposition that supports $(M,ξ)$ is quasi-right-veering. We also show that several definitions of "right-veering" closed braids are equivalent.
We give asymptotically sharp upper bounds for the Khovanov width and the dealternation number of positive braid links, in terms of their crossing number. The same braid-theoretic technique, combined with Ozsváth, Stipsicz, and Szabó's Upsilon invariant, allows us to determine the exact cobordism distance between torus knots with braid index two and six.
We examine the conjecture, due to Champanerkar, Kofman, and Purcell that $\text{vol}(K) < 2 π\log \det (K)$ for alternating hyperbolic links, where $\text{vol}(K) = \text{vol}(S^3\backslash K)$ is the hyperbolic volume and $\det(K)$ is the determinant of $K$. We prove that the conjecture holds for 2-bridge links, alternating 3-braids, and various other infinite families. We show the conjecture holds for highly twisted links and quantify this by showing the conjecture holds when the crossing number of $K$ exceeds some function of the twist number of $K$.
We present a reduced Burau-like representation for the mixed braid group on one strand representing links in lens spaces and show how to calculate the Alexander polynomial of a link directly from the mixed braid.