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

4999148197 · May 202619922001200920172026
48 results for classical unlink

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 ↗

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 ↗

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.

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.

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.

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 ↗

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 ↗

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

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 ↗

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 ↗

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the notion of descending diagram for knots and links in the real space is extended to…

2002-07-31abs ↗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 ↗

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 ↗

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.

A knot K in the 3-sphere is said to have Property nR if, whenever K is a component of an n-component link L and some integral surgery on L produces the connected sum of n copies of S^1 x S^2, there is a sequence of handle slides on L that converts L into a 0-framed unlink. The Generalized Property R Conjecture is that …

2009-08-19abs ↗pdf ↗

We consider the operation of Whitehead double on a component of a link and study the behavior of Milnor invariants under this operation. We show that this operation turns a link whose Milnor invariants of length < k are all zero into a link with vanishing Milnor invariants of length < 2k, and we provide formulas for th…

2007-04-23abs ↗pdf ↗

In this paper, we study surfaces embedded in 44-manifolds. We give a complete set of moves relating banded unlink diagrams of isotopic surfaces in an arbitrary 44-manifold. This extends work of Swenton and Kearton-Kurlin in S4S^4. As an application, we show that bridge trisections of isotopic surfaces in a trisected …

2018-04-24abs ↗pdf ↗

We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids and of their conjugacy classes.

2010-03-31abs ↗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 ↗

We introduce a monoid corresponding to knotted surfaces in four space, from its hyperbolic splitting represented by marked diagram in braid like form. It has four types of generators: two standard braid generators and two of singular type. Then we state relations on words that follows from topological Yoshikawa moves. …

2012-11-28abs ↗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 ↗

Let L \subset S^3 denote an alternating link and Sigma(L) its branched double-cover. We give a short proof of the fact that the fundamental group of Sigma(L) admits a left-ordering iff L is an unlink. This result is originally due to Boyer-Gordon-Watson.

2011-07-26abs ↗pdf ↗

In \cite{PrzytyskiTraczyk} J.H.Przytyski and P.Traczyk introduced an algebraic structure, called {\it a Conway algebra,} and constructed an invariant of oriented links, which is a generalization of the Homflypt polynomial invariant. On the other hand, in \cite{KauffmanLambropoulou} L. H. Kauffman and S. Lambropoulou in…

2017-07-08abs ↗pdf ↗

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 ↗

We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a given invariant. A skein invariant can be computed on each link solely by the use…

2017-03-10abs ↗pdf ↗