English
Related papers

Related papers: Triple Crossing Number and Double Crossing Braid I…

200 papers

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

Geometric Topology · Mathematics 2018-06-13 Charles Livingston

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…

Geometric Topology · Mathematics 2012-07-02 A. A. Akimova , S. V. Matveev

We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots through 7 crossings and nonalternating knots…

Symplectic Geometry · Mathematics 2013-05-08 Wutichai Chongchitmate , Lenhard Ng

We show that, for an alternating knot, the ratio of the diameter of the set of boundary slopes to the crossing number can be arbitrarily large.

Geometric Topology · Mathematics 2019-11-21 Masaharu Ishikawa , Thomas W. Mattman , Kazuya Namiki , Koya Shimokawa

Although there are infinitely many knots with superbridge index n for every even integer n>2, there are only finitely many knots with superbridge index 3.

Geometric Topology · Mathematics 2007-05-23 Choon Bae Jeon , Gyo Taek Jin

The crosscap number of a knot in the 3-sphere is the minimal genus of non-orientable surface bounded by the knot. We determine the crosscap numbers of torus knots.

Geometric Topology · Mathematics 2007-05-23 Masakazu Teragaito

This paper gives new upper bounds on the stick numbers of the knots $9_{18}$, $10_{18}$, $10_{58}$, $10_{66}$, $10_{68}$, $10_{80}$, $10_{82}$, $10_{84}$, $10_{93}$, $10_{100}$, and $10_{152}$, as well as on the equilateral stick number of…

Geometric Topology · Mathematics 2022-07-08 Clayton Shonkwiler

We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However,…

Symplectic Geometry · Mathematics 2017-03-21 Peter Lambert-Cole , David Shea Vela-Vick

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

Algebraic Topology · Mathematics 2019-08-15 Adam Clay , Colin Desmarais , Patrick Naylor

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the…

Geometric Topology · Mathematics 2016-05-03 Sheng Bai , Chao Wang , Jiajun Wang

In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard…

Geometric Topology · Mathematics 2015-03-17 Yuanan Diao , Claus Ernst , Anthony Montemayor

An increasing sequence of integers is said to be universal for knots if every knot has a reduced regular projection on the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…

Geometric Topology · Mathematics 2012-10-02 MurphyKate Montee

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

Geometric Topology · Mathematics 2025-11-26 Yusuke Kuno , Yoshiro Yaguchi

We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this…

Combinatorics · Mathematics 2009-04-23 Elie Feder , David Garber

A weave is the lift to the Euclidean thickened plane of a set of infinitely many planar crossed geodesics, that can be characterized by a number of sets of threads describing the organization of the non-intersecting curves, together with a…

Geometric Topology · Mathematics 2022-02-04 Mizuki Fukuda , Motoko Kotani , Sonia Mahmoudi

To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…

Geometric Topology · Mathematics 2008-08-21 T. Fiedler , V. Kurlin

Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the…

Geometric Topology · Mathematics 2020-06-02 Sarah Goodhill , Adam M. Lowrance , Valeria Munoz Gonzales , Jessica Rattray , Amelia Zeh

An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…

Geometric Topology · Mathematics 2014-01-30 Hyoungjun Kim , Sungjong No , Seungsang Oh

In this work, we find a closed form formula for the braid index of an $n$-bridge braid, a class of positive braid knots which simultaneously generalizes torus knots, 1-bridge braids, and twisted torus knots. Our proof is elementary,…

Geometric Topology · Mathematics 2023-09-12 Dane Gollero , Siddhi Krishna , Marissa Loving , Viridiana Neri , Izah Tahir , Len White

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

Combinatorics · Mathematics 2018-08-01 Vida Dujmović , Ken-ichi Kawarabayashi , Bojan Mohar , David R. Wood