Related papers: Gordian Unlinks
We prove the following results (1) (2) (3) on relations between $n$-links and their components. (1) Let L=(L_1, L_2) be a (4k+1)-link (4k+1\geq 5). Then we have Arf L=Arf L_1+Arf L_2. (2) Let L=(L_1, L_2) be a (4k+3)-link (4k+3\geq3). Then…
We introduce and study strongly invertible Legendrian links in the standard contact three-dimensional space. We establish the equivariant analogs of basic results separately well-known for strongly invertible and Legendrian links, i.e. 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…
It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one "extremal" one among them, i.e., some one which can be continuously "taken away to the infinity"…
We construct infinite families of non-simple isotopy classes of links in overtwisted contact structures on $S^1$-bundles over surfaces. These examples include: (1) a pair of Legendrian links that are not Legendrian isotopic, but which are…
Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…
It is well-known that it is comparatively difficult to design nonconforming finite elements on quadrilateral meshes by using Gauss-Legendre points on each edge of triangulations. One reason lies in that these degrees of freedom associated…
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes…
An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for…
In this paper we discuss gauging one-form symmetries in two-dimensional theories. The existence of a global one-form symmetry in two dimensions typically signals a violation of cluster decomposition -- an issue resolved by the observation…
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 $n$ and unknotting number $n$ for any positive integer…
We construct a moduli space for the connected subgroups of an algebraic group and the corresponding universal family. Morphisms from an algebraic variety to this moduli space correspond to flat families of connected algebraic subgroups…
We show that every non-trivial strongly quasipositive link is smoothly concordant to infinitely many pairwise non-isotopic strongly quasipositive links. In contrast to our result, Baker conjectured that smoothly concordant strongly…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
Let C_T be the subgroup of the smooth knot concordance group generated by topologically slice knots and let C_D be the subgroup generated by knots with trivial Alexander polynomial. We prove the quotient C_T/C_D is infinitely generated, and…
A (2+1)-dimensional quasilinear system is said to be `integrable' if it can be decoupled in infinitely many ways into a pair of compatible n-component one-dimensional systems in Riemann invariants. Exact solutions described by these…
We prove that any arc-presentation of the unknot admits a monotonic simplification by elementary moves; this yields a simple algorithm for recognizing the unknot. We obtain similar results for split links and composite links.
The Upsilon invariant of a knot is a concordance invariant derived from knot Floer homology theory. It is a piecewise linear continuous function defined on the interval $[0,2]$. Borodzik and Hedden gave a question asking for which knots the…
Knotted and tangled structures frequently appear in physical fields, but so do mechanisms for untying them. To understand how this untying works, we simulate the behavior of 1,458 superfluid vortex knots of varying complexity and scale in…