Paper proves link diagrams can be realized for some but not all types of links.
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.
Trend · papers per month
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 , finding a -component unlink as a sub…
We prove that deciding if a diagram of the unknot can be untangled using at most Riedemeister moves (where is part of the input) is NP-hard. We also prove that several natural questions regarding links in the -sphere are NP-hard, including detecting whether a link contains a trivial sublink with componen…
New proof shows a link problem is hard without complex links.
We describe completely the link invariants constructed using Markov traces on the Yokonuma-Hecke algebras in terms of the linking matrix and the HOMFLYPT polynomials of sublinks.
A C_k-move is a local move that involves (k+1) strands of a link. A C_k-move is called a C_k^d-move if these (k+1) strands belong to mutually distinct components of a link. Since a C_k^d-move preserves all k-component sublinks of a link, we consider the converse implication: are two links with common k-component sublin…
Given an -component link in (), we construct a family of links which are link homotopic, but not link isotopic, to . Every proper sublink of such a link is link isotopic to the corresponding sublink of . Moreover, if is an unlink then there exist links that in addition to the above prope…
We use the idea of expressing a nonoriented link as a sum of all oriented links corresponding to the link to present a short proof of the Lickorish-Millett-Turaev formula for the Kauffman polynomial at . Our approach explains the observation made by Lickorish and Millett that the formula is the generatin…
Let L be a link in an integral homology three-sphere. We give a description of the Heegaard Floer homology of integral surgeries on L in terms of some data associated to L, which we call a complete system of hyperboxes for L. Roughly, a complete systems of hyperboxes consists of chain complexes for (some versions of) t…
For every link we construct a complex algebraic plane curve that intersects transversally in a link that contains as a sublink. This construction proves that every link is the sublink of a quasipositive link that is a satellite of the Hopf link. The explicit construction of the complex pla…
If is a classical link then the multivariate Alexander quandle, , is a substructure of the multivariate Alexander module, . In the first paper of this series we showed that if two links and have , then after an appropriate re-indexing of the components of and ,…
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…
We prove that, for any ordinary sense slice 1-link , we can define the Arf invariant and Arf(L)=0. We prove that, for any m-component 1-link L_1, there exists a 3m-component ordinary sense slaice 1-link L_2 of which L_1 is a sublink.
Paper proves a generalized Torres formula for twisted Reidemeister torsion.
We construct infinite families of topologically isotopic but smoothly distinct knotted spheres in many simply connected 4-manifolds that become smoothly isotopic after stabilizing by connected summing with , and as a consequence, analogous families of diffeomorphisms and metrics of positive scalar curva…
We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of $\tria…
We construct a 2-variable link polynomial, called , for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two 1-variable polynomials, one of which is the Alexander polynomial. We refine …
Kervaire's sphere-link is equivalent to a ribbon sphere-link, simplifying complex 2-complexes.
We compute different versions of link Floer homology and for any -space link with two components. The main approach is to compute the -function of the filtered chain complex which is determined by the Alexander polynomials of every sublink of the -space link. As an application, Thurst…
A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power of U_h(sl_2) in which the universal sl_2 invariant of n-component Brunnian bottom…
Study shows rank of knot Floer homology detects Hopf links and classifies second smallest links.
Adjacency defined for three-manifolds, linking them to the 3-sphere.
We study the effect of mutation on link concordance and 3-manifolds. We show that the set of links concordant to sublinks of homology boundary links is not closed under positive mutation. We show that mutation does not preserve homology cobordism classes of 3-manifolds. A significant consequence is that there exist 3-m…
A link L in the 3-sphere is called Brunnian if every proper sublink of L is trivial. In a previous paper, the first author proved that the restriction to Brunnian links of any Goussarov-Vassiliev finite type invariant of (n+1)-component links of degree<2n is trivial. The purpose of this paper is to study the first nont…
CR singularities in 3-manifolds can be cancelled by an isotopy supported in an arbitrarily small neighborhood of a Seifert surface.
For links with vanishing pairwise linking numbers, the link components bound pairwise disjoint surfaces in . In this paper, we describe the set of genera of such surfaces in terms of the -function, which is a link invariant from Heegaard Floer homology. In particular, we use the -function to give lower bou…
We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with Thurston norm at most a given integer; this is shown to be NP-complete. The sec…
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
This note explains how to transform Heegaard diagrams into framed link diagrams.
The paper constructs exotic surface links in 4-ball, proving their Brunnian nature.
New minimal link diagrams found, including torus links and homogeneous ones.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …
Study categorizes knots and links as rigid or shaky based on Reidemeister moves.
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
Table of symmetric diagrams for knots up to 10 crossings.
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…
Proves minimal crossing diagrams for specific spatial graphs.
Rectangular diagrams help analyze foliations in 3-sphere.
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…
The paper explores when specific knot operations simplify diagrams.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
New estimate of semimeander complexity for knots with more than 10 crossings.
GridPyM handles grid diagrams for knot theory.