scholarly journals Knots with Equal Bridge Index and Braid Index

Author(s):  
Yuanan Diao ◽  
Claus Ernst ◽  
Philipp Reiter
Keyword(s):  
Author(s):  
Sangyop Lee
Keyword(s):  

A twisted torus knot [Formula: see text] is a torus knot [Formula: see text] with [Formula: see text] adjacent strands twisted fully [Formula: see text] times. In this paper, we determine the braid index of the knot [Formula: see text] when the parameters [Formula: see text] satisfy [Formula: see text]. If the last parameter [Formula: see text] additionally satisfies [Formula: see text], then we also determine the parameters [Formula: see text] for which [Formula: see text] is a torus knot.


2015 ◽  
Vol 55 (1) ◽  
pp. 169-180 ◽  
Author(s):  
Hideo Takioka
Keyword(s):  

1992 ◽  
Vol 111 (2) ◽  
pp. 273-281 ◽  
Author(s):  
D. A. Chalcraft

AbstractThe number of Seifert circuits in a diagram of a link is well known 9 to be an upper bound for the braid index of the link. The -breadth of the so-called P-polynomial 3 of the link is known 5, 2 to give a lower bound. In this paper we consider a large class of links diagrams, including all diagrams where the interior of every Seifert circuit is empty. We show that either these bounds coincide, or else the upper bound is not sharp, and we obtain a very simple criterion for distinguishing these cases.


2020 ◽  
Vol 29 (04) ◽  
pp. 2050019
Author(s):  
Yuanan Diao

For an unoriented link [Formula: see text], let [Formula: see text] be the ropelength of [Formula: see text]. It is known that in general [Formula: see text] is at least of the order [Formula: see text], and at most of the order [Formula: see text] where [Formula: see text] is the minimum crossing number of [Formula: see text]. Furthermore, it is known that there exist families of (infinitely many) links with the property [Formula: see text]. A long standing open conjecture states that if [Formula: see text] is alternating, then [Formula: see text] is at least of the order [Formula: see text]. In this paper, we show that the braid index of a link also gives a lower bound of its ropelength. More specifically, we show that there exists a constant [Formula: see text] such that [Formula: see text] for any [Formula: see text], where [Formula: see text] is the largest braid index among all braid indices corresponding to all possible orientation assignments of the components of [Formula: see text] (called the maximum braid index of [Formula: see text]). Consequently, [Formula: see text] for any link [Formula: see text] whose maximum braid index is proportional to its crossing number. In the case of alternating links, the maximum braid indices for many of them are proportional to their crossing numbers hence the above conjecture holds for these alternating links.


2013 ◽  
Vol 22 (06) ◽  
pp. 1350025 ◽  
Author(s):  
BYUNG HEE AN ◽  
KI HYOUNG KO
Keyword(s):  

We show that there is a family of pseudo-Anosov braids independently parametrized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length.


1993 ◽  
Vol 45 (1) ◽  
pp. 117-131 ◽  
Author(s):  
Yoshiyuki Ohyama

AbstractIn this paper we prove an inequality that involves the minimal crossing number and the braid index of links by estimating Murasugi and Przytycki’s index for a planar bipartite graph.


Author(s):  
H. R. Morton
Keyword(s):  

In this paper I shall show how certain bounds on the possible diagrams presenting a given oriented knot or link K can be found from its two-variable polynomial PK defined in [3]. The inequalities regarding exponent sum and braid index of possible representations of K by a closed braid which are proved in [5] and [2] follow as a special case.


2010 ◽  
Vol 157 (1) ◽  
pp. 247-260 ◽  
Author(s):  
Sang Youl Lee ◽  
Myoungsoo Seo
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document