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,742 papers · 148 categories

Trend · papers per month

6111722 · May 202219922001200920172026
48 results for sublink diagrams

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

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…

2012-02-13abs ↗pdf ↗

Given an mm-component link LL in S3S^3 (m2m \ge 2), we construct a family of links which are link homotopic, but not link isotopic, to LL. Every proper sublink of such a link is link isotopic to the corresponding sublink of LL. Moreover, if LL is an unlink then there exist links that in addition to the above prope…

2016-01-20abs ↗pdf ↗

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 z=aa1z= -a- a^{-1}. Our approach explains the observation made by Lickorish and Millett that the formula is the generatin…

2012-08-24abs ↗pdf ↗

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…

2010-11-05abs ↗pdf ↗

For every link LL we construct a complex algebraic plane curve that intersects S3S^3 transversally in a link L~\tilde{L} that contains LL as a sublink. This construction proves that every link LL is the sublink of a quasipositive link that is a satellite of the Hopf link. The explicit construction of the complex pla…

2019-07-24abs ↗pdf ↗

If LL is a classical link then the multivariate Alexander quandle, QA(L)Q_A(L), is a substructure of the multivariate Alexander module, MA(L)M_A(L). In the first paper of this series we showed that if two links LL and LL' have QA(L)QA(L)Q_A(L) \cong Q_A(L'), then after an appropriate re-indexing of the components of LL and LL',…

2019-05-20abs ↗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 ↗

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 S2×S2S^2 \times S^2, and as a consequence, analogous families of diffeomorphisms and metrics of positive scalar curva…

2014-06-19abs ↗pdf ↗

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…

2010-06-03abs ↗pdf ↗

We construct a 2-variable link polynomial, called WLW_L, 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 WLW_L

2007-04-23abs ↗pdf ↗

Kervaire's sphere-link is equivalent to a ribbon sphere-link, simplifying complex 2-complexes.

problem Understanding the structure of 2-complexes and their asphericity.
method Using Kervaire's sphere-link and ribbon sphere-link equivalence, analyzing the compact complement of ribbon disk-links.
result Every connected subcomplex of a contractible finite 2-complex is aspherical.

We compute different versions of link Floer homology HFLHFL^{-} and HFL^\widehat{HFL} for any LL-space link with two components. The main approach is to compute the hh-function of the filtered chain complex which is determined by the Alexander polynomials of every sublink of the LL-space link. As an application, Thurst…

2017-04-08abs ↗pdf ↗

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…

2011-11-27abs ↗pdf ↗

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…

2005-10-25abs ↗pdf ↗

For links with vanishing pairwise linking numbers, the link components bound pairwise disjoint surfaces in B4B^{4}. In this paper, we describe the set of genera of such surfaces in terms of the hh-function, which is a link invariant from Heegaard Floer homology. In particular, we use the hh-function to give lower bou…

2018-05-05abs ↗pdf ↗

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…

2016-02-26abs ↗pdf ↗

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.

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 …

2016-06-02abs ↗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.

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.

2007-06-19abs ↗pdf ↗

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…

2017-12-25abs ↗pdf ↗

Problems on region choices for knot and link diagrams solved using Alexander numbering.

problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.

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…

2018-03-19abs ↗pdf ↗

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…

2006-04-30abs ↗pdf ↗

The paper explores when specific knot operations simplify diagrams.

problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

New estimate of semimeander complexity for knots with more than 10 crossings.

problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.311.558cr(K)0.31 \cdot 1.558^{\operatorname{cr}(K)} crossings.