Related papers: Braid group and leveling of a knot

The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…

Covering moves relate colored link diagrams appearing as the branch sets of simple branched coverings of $S^3$ by the same 3-manifold. We provide a complete set of covering moves on plat closures of braids in each fixed degree $d \geq 4$,…

Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We…

The ropelength of a knot is the minimum contour length of a tube of unit radius that traces out the knot in three dimensional space without self-overlap, colloquially the minimum amount of rope needed to tie a given knot. Theoretical upper…

A knot K is called n-adjacent to the unknot, if K admits a projection containing n generalized crossings such that changing any m (no larger than n) of them yields a projection of the unknot. We show that a non-trivial satellite knot K is…

In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…

We show that every knot is one crossing change away from a knot of arbitrarily high bridge number and arbitrarily high bridge distance.

A knot K is called a 1-genus 1-bridge knot in a 3-manifold M if (M,K) has a Heegaard splitting (V_1,t_1)\cup (V_2,t_2) where V_i is a solid torus and t_i is a boundary parallel arc properly embedded in V_i. If the exterior of a knot has a…

In this article we study the braid indices of 2-bridge knots with a fixed crossing number $c$. We show that the average braid index of the set of $2$-bridge knots of crossing number $c$ is asymptotically linear, approaching…

We provide explicit formulas for the integer-valued smooth concordance invariant $\upsilon(K) = \Upsilon_K(1)$ for every 3-braid knot $K$. We determine this invariant, which was defined by Ozsv\'ath, Stipsicz and Szab\'o, by constructing…

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index…

We determine the locally flat cobordism distance between torus knots with small and large braid index, up to high precision. Here small means 2, 3, 4, or 6. As an application, we derive a surprising fact about torus knots that appear as…

Bonded knots arise naturally in topological protein modeling, where intramolecular interactions such as disulfide bridges stabilize folded configurations. These structures extend classical knot theory by incorporating embedded graphs, and…

Twisted torus knots and links are given by twisting adjacent strands of a torus link. They are geometrically simple and contain many examples of the smallest volume hyperbolic knots. Many are also Lorenz links. We study the geometry of…

For a knot K, let b_n(K) be the minimum length of an n-stranded braid representative of K. Examples of knots exist for which b_n(K) is a non-increasing function. We investigate the behavior of b_n(K). We develop bounds on the function in…

Burau representation of the Artin braid group remains as one of the very important representations for the braid group. Partly, because of its connections to the Alexander polynomial which is one of the first and most useful invariants for…

The Turaev genus and dealternating number of a link are two invariants that measure how far away a link is from alternating. We determine the Turaev genus of a torus knot with five or fewer strands either exactly or up to an error of at…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…