scholarly journals The braid index of DNA double crossover polyhedral links

PLoS ONE ◽  
2020 ◽  
Vol 15 (2) ◽  
pp. e0228855
Author(s):  
Xiao-Sheng Cheng ◽  
Yuanan Diao
Keyword(s):  
Double Crossover ◽  
Polyhedral Links ◽  
Braid Index

scholarly journals The Braid Index of Complicated DNA Polyhedral Links

PLoS ONE ◽  
2012 ◽  
Vol 7 (11) ◽  
pp. e48968 ◽  
Author(s):  
Xiao-Sheng Cheng ◽  
Xian'an Jin
Keyword(s):  
Polyhedral Links ◽  
Braid Index

The braid index of polyhedral links

2012 ◽  
Vol 50 (6) ◽  
pp. 1386-1397 ◽  
Author(s):  
Xiao-Sheng Cheng ◽  
Xiaoyan Jiang ◽  
Huawei Dai
Keyword(s):  
Polyhedral Links ◽  
Braid Index

Ear decomposition of 3-regular polyhedral links with applications

2014 ◽  
Vol 359 ◽  
pp. 146-154 ◽  
Author(s):  
Xiao-Sheng Cheng ◽  
Heping Zhang ◽  
Xian׳an Jin ◽  
Wen-Yuan Qiu
Keyword(s):  
Polyhedral Links ◽  
Ear Decomposition

Twisted torus knots T(mn + m + 1,mn + 1,mn + m + 2,−1) and T(n + 1,n,2n − 1,−1) are torus knots

2021 ◽  
pp. 2150016
Author(s):  
Sangyop Lee
Keyword(s):  
Torus Knots ◽  
Torus Knot ◽  
Braid Index

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.

scholarly journals On the Braid Index of Kanenobu Knots

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

On the braid index of links with nested diagrams

1992 ◽  
Vol 111 (2) ◽  
pp. 273-281 ◽  
Author(s):  
D. A. Chalcraft
Keyword(s):  
Lower Bound ◽  
Large Class ◽  
Upper Bound ◽  
Simple Criterion ◽  
Braid Index

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.

Sign in / Sign up

Export Citation Format

Share Document