中文
相关论文

相关论文: Unlinking Number and Unlinking Gap

200 篇论文

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking…

几何拓扑 · 数学 2018-03-16 Lavinia Bulai

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

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

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

几何拓扑 · 数学 2026-03-25 Duncan McCoy , JungHwan Park

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

Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…

几何拓扑 · 数学 2011-07-13 Slavik Jablan

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 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…

几何拓扑 · 数学 2018-06-13 Charles Livingston

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

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

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 describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…

几何拓扑 · 数学 2025-12-11 Isaias Bahena , Thomas Kindred , Jason Parsley

We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…

几何拓扑 · 数学 2016-04-19 Efstratia Kalfagianni , Christine Ruey Shan Lee

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

We show how the signed evaluations of link polynomials can be used to calculate unknotting numbers. We use the Jones-Rong value of the Brandt-Lickorish-Millett-Ho polynomial Q to calculate the unknotting numbers of 8_{16}, 9_{49} and 6…

几何拓扑 · 数学 2008-08-30 A. Stoimenow

We use the rational Witt class of a knot in the 3-sphere as a tool for addressing questions about its unknotting number. We apply these tools to several low crossing knots (151 knots with 11 crossing and 100 knots with 12 crossings) and to…

几何拓扑 · 数学 2009-07-15 Stanislav Jabuka

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

Unknotting numbers for torus knots and links are well known. In this paper, we present a method for determining the position of unknotting number crossing changes in a toric braid B(p, q) such that the closure of the resultant braid is…

几何拓扑 · 数学 2012-07-23 Vikash Siwach , Madeti Prabhakar

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

几何拓扑 · 数学 2011-04-25 Yuanyuan Bao

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

几何拓扑 · 数学 2016-11-01 Liangxia Wan
‹ 上一页 1 2 3 10 下一页 ›