Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

109218326435 · Jun 202019922001200920172026
48 results for unlinking number

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for w…

2005-03-14abs ↗pdf ↗

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

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 numbers of links with crossing number at most 9. Ultimately, we find the unlinkin…

2017-01-05abs ↗pdf ↗

Study sharpens unlinking number bounds for special alternating links.

problem Determining the exact unlinking number for special alternating links.
method Analyzes links in the 3-sphere, focusing on special alternating links and their crossing changes.
result Sharp lower bounds for unlinking number realized by crossing changes in alternating diagrams.

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 crossing changes needed to unlink without changing the crossings between components. …

2019-06-29abs ↗pdf ↗

We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.

2014-10-08abs ↗pdf ↗

We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation theorem to complete the table of unlinking numbers for nonsplit prime links wit…

2015-03-10abs ↗pdf ↗

We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link has an unlinking or splitting number kk, finding a kk-component unlink as a sub…

2018-09-27abs ↗pdf ↗

Paper finds first examples of unlinked knots that can't be separated.

problem Separating knots without changing their length and thickness.
method Constructs infinite families of 2-component gordian unlinks and nn-component links for n2n \geq 2.
result Found infinite families of 2-component gordian unlinks that cannot be separated.

We show that every quasipositive link has a quasipositive minimal braid representative, partially resolving a question posed by Orevkov. These quasipositive minimal braids are used to show that the maximal self-linking number of a quasipositive link is bounded below by the negative of the minimal braid index, with equa…

2016-05-05abs ↗pdf ↗

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime surface-unknot and surface-unlink diagrams with prime base surface components up to …

2017-06-28abs ↗pdf ↗

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three components. If L_1 is a Brunnian link with all pairwise linking numbers 0, and t…

1999-12-01abs ↗pdf ↗

The paper examines when 2-string tangles can be embedded into specific link types.

problem When 2-string tangles can be embedded into the unknot, unlink, or split links.
method Geometric characterizations, tangle sums, and colorings.
result Prime 2-string tangles with up to seven crossings are classified for embedding into specific link types.

We apply the Rasmussen spectral sequence to prove that the Z3\mathbb{Z}^3-graded vector space structure of the HOMFLYPT homology over Z2\mathbb{Z}_2 detects unlinks. Our proof relies on a theorem of Batson and Seed stating that the Z2\mathbb{Z}^2-graded vector space structure of the Khovanov homology over $\mathbb{Z}_2…

2017-08-23abs ↗pdf ↗

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

problem Classifying knots and links as rigid or shaky based on adaptability to Reidemeister moves.
method Categorization of hard diagrams as rigid or shaky, investigation of rigid and shaky hard diagrams for specific knots and links.
result Every link has a rigid hard diagram, and there is an upper limit for the number of crossings in such diagrams.

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 therefore also determine whether the unlinking number of L is 1.

2018-08-16abs ↗pdf ↗

The depth of a link measures the minimum height of a resolving tree for the link whose leaves are all unlinks. We show that the depth of the closure of a strictly positive braid word is the length of the word minus the number of distinct letters.

2014-12-03abs ↗pdf ↗

In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link diagram invariant using irregular smoothing, and give an example of a knot diagram…

2011-03-26abs ↗pdf ↗

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being unknotted with resp…

2010-12-18abs ↗pdf ↗

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…

2018-07-29abs ↗pdf ↗

Given a link in S3S^3 we will use invariants derived from the Alexander module and the Blanchfield pairing to obtain lower bounds on the Gordian distance between links, the unlinking number and various splitting numbers. These lower bounds generalise results recently obtained by Kawauchi. We give an application restric…

2014-09-30abs ↗pdf ↗

We prove that deciding if a diagram of the unknot can be untangled using at most kk Riedemeister moves (where kk is part of the input) is NP-hard. We also prove that several natural questions regarding links in the 33-sphere are NP-hard, including detecting whether a link contains a trivial sublink with nn componen…

2018-10-08abs ↗pdf ↗

We construct a new spectral sequence beginning at the Khovanov homology of a link and converging to the Khovanov homology of the disjoint union of its components. The page at which the sequence collapses gives a lower bound on the splitting number of the link, the minimum number of times its components must be passed t…

2013-03-25abs ↗pdf ↗

Negami found an upper bound on the stick number s(K)s(K) of a nontrivial knot KK in terms of the minimal crossing number c(K)c(K) of the knot which is s(K)2c(K)s(K) \leq 2 c(K). Furthermore McCabe proved s(K)c(K)+3s(K) \leq c(K) + 3 for a 22-bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we const…

2014-11-07abs ↗pdf ↗

New method for regression in high-dimensional space using mixture modeling and optimal transport.

problem Regression in high-dimensional space with unordered data.
method Mixture modeling and optimal transport for permutation recovery and denoising.
result Explicit upper bounds on mean squared denoising error for Gaussian noise.

The Levine-Tristram signature associates to each oriented link LL in S3S^3 a function σL ⁣:S1Z.σ_L \colon S^1 \to \mathbb{Z}. This invariant can be defined in a variety of ways, and its numerous applications include the study of unlinking numbers and link concordance. In this survey, we recall the three and four dimensional …

2019-03-11abs ↗pdf ↗

We show that the only irreducible three-manifold with positive first Betti number and Heegaard Floer homology of rank two is homeomorphic to zero-framed surgery on the trefoil. We classify links whose branched double cover gives rise to this manifold. Together with a spectral sequence from Khovanov homology to the Floe…

2009-06-25abs ↗pdf ↗

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 splitting number split(L) is greater than or equal to r+s-1, and less than or equa…

2010-06-29abs ↗pdf ↗