中文
相关论文

相关论文: Strict Inequalities for the $n$-crossing Number

200 篇论文

A long standing open conjecture states that if a link $\mathcal{K}$ is alternating, then its ropelength $L(\mathcal{K})$ is at least of the order $O(Cr(\mathcal{K}))$. A recent result shows that the maximum braid index of a link bounds the…

几何拓扑 · 数学 2021-08-25 Yuanan Diao

We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…

几何拓扑 · 数学 2025-02-14 Keegan Boyle , Wenzhao Chen

We discuss relations among various positivities of knots and links, such as strong quasipositivity and quasipositivity. We give several pieces of supporting evidence for conjectural statements concerning these positivities and the defect of…

几何拓扑 · 数学 2018-10-01 Jesse Hamer , Tetsuya Ito , Keiko Kawamuro

The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…

几何拓扑 · 数学 2010-05-26 Stavros Garoufalidis

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

计算几何 · 计算机科学 2019-08-13 Arnaud de Mesmay , Marcus Schaefer , Eric Sedgwick

Since the crossing number of K_{12} is now known to be 150, it is well-known that simple counting arguments and Kleitman's parity theorem for the crossing number of K_{2n+1} combine with a specific drawing of K_{13} to show that the…

组合数学 · 数学 2013-07-15 Dan McQuillan , Shengjun Pan , R. Bruce Richter

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

This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number.…

几何拓扑 · 数学 2011-03-02 Yukiko Abe

We show that a knot whose minimum crossing number $c(K)$ is even and greater than $30$ is not fertile; there exists a knot $K'$ with crossing number less than $c$ such that $K'$ is not obtained from a minimum crossing number diagram of $K$…

几何拓扑 · 数学 2021-11-30 Tetsuya Ito

We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…

几何拓扑 · 数学 2014-04-01 Slavik Jablan , Radmila Sazdanović

There are infinitely many pretzel links with the same Alexander polynomial (actually with trivial Alexander polynomial). By contrast, in this note we revisit the Jones polynomial of pretzel links and prove that, given a natural number S,…

几何拓扑 · 数学 2020-11-20 R. Díaz , P. M. G. Manchón

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

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

历史与综述 · 数学 2007-12-17 Pierre-Vincent Koseleff , Daniel Pecker

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

组合数学 · 数学 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

The ribbon number $r(K)$ of a ribbon knot $K \subset S^3$ is the minimal number of ribbon intersections contained in any ribbon disk bounded by $K$. We find new lower bounds for $r(K)$ using $\det(K)$ and $\Delta_K(t)$, and we prove that…

几何拓扑 · 数学 2024-08-22 Stefan Friedl , Filip Misev , Alexander Zupan

We demonstrate that the equivariant unknotting number $\widetilde{u}(K)$ of a strongly invertible knot $K$ is bounded below by the $H$-torsion order $\widetilde{\mathrm{ord}}(K)$ of the involutive Bar-Natan homology…

几何拓扑 · 数学 2026-04-13 KeeTaek Kim

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…

几何拓扑 · 数学 2007-05-23 Efstratia Kalfagianni , Xiao-Song Lin

We define the symmetric braid index $b_s(K)$ of a ribbon knot $K$ to be the smallest index of a braid whose closure yields a symmetric union diagram of $K$, and derive a Khovanov-homological characterisation of knots with $b_s(K)$ at most…

几何拓扑 · 数学 2025-10-08 Vitalijs Brejevs , Feride Ceren Kose

Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an \"ubercrossing projection, a knot…

For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…

几何拓扑 · 数学 2026-02-11 Tetsuya Ito