中文
相关论文

相关论文: The crossing number and maximal bridge length of a…

200 篇论文

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…

几何拓扑 · 数学 2021-07-09 Ryan Blair , Alexandra A. Kjuchukova , Makoto Ozawa

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…

几何拓扑 · 数学 2018-09-14 Erwan Brugallé , Pierre-Vincent Koseleff , Daniel Pecker

We provide a combinatorial characterisation of positive diagrams satisfying the equality in the Morton-Franks-Williams bound for the degrees of the HOMFLY-PT polynomial. This characterisation allows generating with relative ease examples of…

几何拓扑 · 数学 2022-11-30 Ilya Alekseev

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

几何拓扑 · 数学 2009-07-07 Keiko Kawamuro

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

几何拓扑 · 数学 2023-04-04 Jundai Nanasawa

Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…

几何拓扑 · 数学 2020-09-08 Philipp Korablev , Vladimir Tarkaev

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

几何拓扑 · 数学 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

几何拓扑 · 数学 2007-05-23 A. Stoimenow

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane…

几何拓扑 · 数学 2014-11-25 Erwan Brugallé , Pierre-Vincent Koseleff , Daniel Pecker

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…

几何拓扑 · 数学 2018-08-13 Moshe Cohen , Chaim Even-Zohar , Sunder Ram Krishnan

In this paper, we consider two properties on the braid index of a two-bridge knot. We prove an inequality on the braid indices of two-bridge knots if there exists an epimorphism between their knot groups. Moreover, we provide the average…

几何拓扑 · 数学 2023-10-05 Masaaki Suzuki , Anh T. Tran

It is known that the maximal homological degree of the Khovanov homology of a knot gives a lower bound of the minimal positive crossing number of the knot. In this paper, we show that the maximal homological degree of the Khovanov homology…

几何拓扑 · 数学 2017-01-18 Keiji Tagami

We show that every two-bridge knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_3(t), y = T_b(t), z =C(t)$ where $T_k(t)$ are the Chebyshev polynomials and $b+\deg C = 3N$. If $C (t)= T_c(t)$ is a Chebyshev…

几何拓扑 · 数学 2009-09-18 Pierre-Vincent Koseleff , Daniel Pecker

We adapt Thistlethwaite's alternating tangle decomposition of a knot diagram to identify the potential extreme terms in its bracket polynomial, and give a simple combinatorial calculation for their coefficients, based on the intersection…

几何拓扑 · 数学 2007-05-23 Yongju Bae , H. R. Morton

It has long been known that the quadratic term in the degree of the colored Jones polynomial of a knot is bounded above in terms of the crossing number of the knot. We show that this bound is sharp if and only if the knot is adequate. As an…

几何拓扑 · 数学 2023-02-14 Efstratia Kalfagianni , Christine Ruey Shan Lee

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

几何拓扑 · 数学 2026-02-19 Makoto Ozawa

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it…

几何拓扑 · 数学 2007-08-28 Sangbum Cho , Darryl McCullough

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced…

几何拓扑 · 数学 2008-12-09 Sangbum Cho , Darryl McCullough

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

几何拓扑 · 数学 2007-05-24 Makoto Ozawa
‹ 上一页 1 2 3 10 下一页 ›