中文
相关论文

相关论文: Splitting numbers of links and the four-genus

200 篇论文

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…

几何拓扑 · 数学 2013-08-27 Jae Choon Cha , Stefan Friedl , Mark Powell

The splitting number of a link is the minimal number of crossing changes between different components required to convert it into a split link. We obtain a lower bound on the splitting number in terms of the (multivariable) signature and…

几何拓扑 · 数学 2016-10-27 David Cimasoni , Anthony Conway , Kleopatra Zacharova

We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…

几何拓扑 · 数学 2021-03-02 Marc Lackenby

The weak splitting number $wsp(L)$ of a link $L$ is the minimal number of crossing changes needed to turn $L$ into a split union of knots. We describe conditions under which certain $\mathbb{R}$-valued link invariants give lower bounds on…

几何拓扑 · 数学 2020-05-12 Alberto Cavallo , Carlo Collari , Anthony Conway

It is known that algebraically split links (links with vanishing pairwise linking number) can be transformed into the trivial link by a series of local moves on the link diagram called delta-moves; we define the delta-unlinking number to be…

几何拓扑 · 数学 2021-07-15 Anthony Bosman , Jeannelle Green , Gabriel Palacios , Moises Reyes , Noe Reyes

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

几何拓扑 · 数学 2019-02-20 Colin Adams

In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete…

几何拓扑 · 数学 2011-01-04 Ayaka Shimizu

The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…

几何拓扑 · 数学 2008-02-18 Brendan Owens

The slicing degree of a knot $K$ is defined as the smallest integer $k$ such that $K$ is $k$-slice in $\#^n \overline{\mathbb{CP}^2}$ for some $n$. In this paper, we establish bounds for the slicing degrees of knots using Rasmussen's…

几何拓扑 · 数学 2024-04-25 Qianhe Qin

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…

几何拓扑 · 数学 2016-06-22 Kenan Ince

An open question asks if every knot of 4-genus g_s can be changed into a slice knot by g_s crossing changes. A counterexample is given.

几何拓扑 · 数学 2014-10-01 Charles Livingston

We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices…

几何拓扑 · 数学 2014-12-24 Loren Abrams , Blake Mellor , Lowell Trott

The untwisting number of a knot K is the minimum number of null-homologous twists required to convert K to the unknot. Such a twist can be viewed as a generalization of a crossing change, since a classical crossing change can be effected by…

In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of…

几何拓扑 · 数学 2020-05-26 Natalie DuBois , Chris Eufemia , Jeff Johannes , Jenna Zomback

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…

几何拓扑 · 数学 2019-11-12 Puttipong Pongtanapaisan

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

几何拓扑 · 数学 2012-09-05 Colin Adams

In this paper, we enumerate the number of oriented rational knots and the number of oriented rational links with any given crossing number and minimum genus. This allows us to obtain a precise formula for the average minimal genus of…

几何拓扑 · 数学 2022-04-28 Dawn Ray , Yuanan Diao

The twisting number of a ribbon knot $K$ is the minimal number of tangle replacements on the symmetry axis of $J \# -J$ for any knot $J$ that is required to produce a symmetric union diagram of $K$. We prove that the twisting number is…

几何拓扑 · 数学 2024-06-24 Vitalijs Brejevs , Peter Feller

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

几何拓扑 · 数学 2007-05-23 Tatsuya Tsukamoto

The surgery unknotting number of a Legendrian link is defined as the minimal number of particular oriented surgeries that are required to convert the link into a Legendrian unknot. Lower bounds for the surgery unknotting number are given in…

辛几何 · 数学 2016-01-20 A. Bianca Boranda , Lisa Traynor , Shuning Yan
‹ 上一页 1 2 3 10 下一页 ›