English
Related papers

Related papers: Minimal crossing number implies minimal supporting…

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

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

Geometric Topology · Mathematics 2020-05-25 Michal Jablonowski , Lukasz Trojanowski

We study virtual isotopy sequences with classical initial and final diagrams, asking when such a sequence can be changed into a classical isotopy sequence by replacing virtual crossings with classical crossings. An example of a sequence for…

Geometric Topology · Mathematics 2007-05-23 Sam Nelson

We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…

Geometric Topology · Mathematics 2020-11-10 Michal Jablonowski

We prove that the degree of the Brandt-Lickorish-Millet polynomial of any quasi-alternating link is less than its determinant. Therefore, we obtain a new and a simple obstruction criterion for quasi-alternateness. As an application, we…

Geometric Topology · Mathematics 2016-01-20 Khaled Qazaqzeh , Nafaa Chbili

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…

Geometric Topology · Mathematics 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

Virtual links are generalizations of classical links that can be represented by links embedded in a ``thickened'' surface $\Sigma\times I$, product of a Riemann surface of genus $h$ with an interval. In this paper, we show that virtual…

Mathematical Physics · Physics 2007-05-23 P. Zinn-Justin , J. -B. Zuber

Several authors have recently studied virtual knots and links because they admit invariants arising from R-matrices. We prove that every virtual link is uniquely represented by a link L in S X I, a thickened, compact, oriented surface S,…

Geometric Topology · Mathematics 2014-10-01 Greg Kuperberg

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

Geometric Topology · Mathematics 2007-05-23 Louis H. Kauffman

In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant…

Geometric Topology · Mathematics 2019-07-23 Heather A. Dye , Aaron Kaestner

We present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…

Geometric Topology · Mathematics 2020-09-01 Julia Collins , Paul Kirk , Charles Livingston

Study of certain isotopy classes of a finite collection of immersed circles without triple or higher intersections on closed oriented surfaces can be thought of as a planar analogue of virtual knot theory where the genus zero case…

Geometric Topology · Mathematics 2021-07-19 Neha Nanda , Mahender Singh

The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing…

Combinatorics · Mathematics 2008-09-09 Drago Bokal , Gašper Fijavž , David R. Wood

We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have…

Geometric Topology · Mathematics 2015-12-01 Seungwon Kim

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

Geometric Topology · Mathematics 2024-12-18 Khaled Qazaqzeh , Nafaa Chbili

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

Geometric Topology · Mathematics 2021-12-15 A. Skopenkov

In this paper I give estimates for the minimal crossing number, leading to a short proof that the crossing number is additive for torus links. These estimates are applied to several classes of links. Finally, I prove a part of a conjecture…

Geometric Topology · Mathematics 2007-05-23 Hermann Gruber

The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…

Geometric Topology · Mathematics 2025-04-16 Christoph Lamm , Michael Eisermann

The concordance genus of a knot is the least genus of any knot in its concordance class. It is bounded above by the genus of the knot, and bounded below by the slice genus, two well-studied invariants. In this paper we consider the…

Geometric Topology · Mathematics 2015-03-20 M. Kate Kearney

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
‹ Prev 1 3 4 5 6 7 10 Next ›