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.
Paper finds first examples of unlinked knots that can't be separated.
New examples of gordian unlinks show different rope geometries.
Given a link in 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…
Proves links can be simplified to trivial form in few changes, limiting Milnor's invariants.
A knot K is called Gordian adjacent to a knot L if there exists an unknotting sequence for L containing K. We provide a sufficient condition for Gordian adjacency of torus knots via the study of knots in the thickened torus. We also completely describe Gordian adjacency for torus knots of index 2 and 3 using Levine-Tri…
Quotients of Gordian and H(2)-Gordian graphs are hyperbolic.
Lower bounds on Gordian distance using Blanchfield pairings.
Using Blanchfield pairings, we show that two Alexander polynomials cannot be realized by a pair of matrices with Gordian distance one if a corresponding quadratic equation does not have an integer solution. We also give an example of how our results help in calculating the Gordian distances, algebraic Gordian distances…
New bounds for knot distances using Khovanov homology.
The Gordian distance between two knots measures how many crossing changes are needed to transform one knot into the other. It is known that there are always infinitely many non-equivalent knots `between' a pair of knots of Gordian distance two. In this paper we prove an extreme generalisation of this fact: there are kn…
Study of Gordian graphs' behavior at infinity for various local moves.
We give lower bounds for the Gordian distance and the unknotting number of handlebody-knots by using Alexander biquandle colorings. We construct handlebody-knots with Gordian distance and unknotting number for any positive integer .
A knot is said to be Gordian adjacent to a knot if is an intermediate knot on an unknotting sequence of . We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between classes of positive braid knots through manipulations of braid words. In additio…
Study knots with genus one, finds Gordian distance and cosmetic crossing constraints.
A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian di…
Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in . Later Horiuchi and Ohyama defined Gordian complex of virtual knots using -move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…
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…
Starting from a divide, i.e. a generic immersion of finitely many copies of the interval [0,1] in the disk, we construct a classical link in the 3-sphere. We prove that the link's complement fibers over the circle, if the divide is connected. Moreover, we compute the monodromy diffeomorphism from the combinatorics of t…
New invariant measures how many twists are needed to unknot welded knots.
New spanning 3-disks found for unlink in 4-sphere.
The paper classifies twisted torus links that are unlinks.
Delta-unlinking number measures how to unlink algebraically split links.
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 …
Infinitely many splitting spheres found for unlinked 2-spheres in 4-space.
We introduce new simplicial complexes by using various invariants and local moves for knots, which give generalizations of the Gordian complex defined by Hirasawa and Uchida. In particular, we focus on the simplicial complex defined by using the Alexander-Conway polynomial and the Delta-move, and show that the simplici…
Study sharpens unlinking number bounds for special alternating links.
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…
Simplified plat diagrams for unlink without stabilization.
Paper introduces a new invariant for planar knotoids.
We present a class of knots associated with labelled generic immersions of intervals into the plane and compute their Gordian numbers and 4-dimensional invariants. At least 10% of the knots in Rolfsen's table belong to this class of knots. We call them track knots. They are contained in the class of quasipositive knots…
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. …
We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where all meridians are mapped to transpositions. Incidentally, we verify the Meridio…
The paper examines when 2-string tangles can be embedded into specific link types.
We apply the Rasmussen spectral sequence to prove that the -graded vector space structure of the HOMFLYPT homology over detects unlinks. Our proof relies on a theorem of Batson and Seed stating that the -graded vector space structure of the Khovanov homology over $\mathbb{Z}_2…
We prove a homological stability theorem for unlinked circles in -manifolds and give an application to certain groups of diffeomorphisms of 3-manifolds.
We construct a pair of isotopic link configurations that are not thick isotopic while preserving total length.
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.
Let n be a positive integer. We provide a Khovanov homology proof of the following classical fact: If the closure of an n-strand braid is the n-component unlink, then the braid is trivial.
Study shows torsion order bounds band-unlinking number for knot cobordisms.
We show that every knot is one crossing change away from a knot of arbitrarily high bridge number and arbitrarily high bridge distance.
Study surfaces in 4-manifolds using banded unlink diagrams.
New examples show limits of physical link isotopies.
Minimal moves for surfaces in 4D identified.
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…
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…
New knot graphs show most are not Gromov hyperbolic, with special cases.
We prove that if n\ge1, then an (n+1)-component Brunnian link L in a connected, oriented 3-manifold is C_n-equivalent to an unlink. We also prove that if n\ge2, then L can not be distinguished from an unlink by any Goussarov-Vassiliev finite type invariant of degree<2n.
New rational band moves simplify knot classification.