New method encodes knots using clasp diagrams for easier study of invariants.
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
New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.
Category theory generalizes finite type invariants using diagrams systems.
Classifies certain 3D knots with specific properties.
New invariants improve Heegaard Floer slice genus and clasp number bounds.
The paper characterizes and contrasts knots with high 4D clasp numbers.
New examples show clasp numbers can be zero yet four-genus can be arbitrarily large.
The clasp number of a knot is the minimum number of clasp singularities among all clasp disks bounded by . It is known that the genus and the unknotting number are lower bounds of the clasp number, that is, . Then it is natural to ask whether there exists a knot …
We analyze properties of links which have diagrams with a small number of negative crossings. We show that if a nontrivial link has a diagram with all crossings positive except possibly one, then the signature of the link is negative. If a link diagram has two negative crossings, we show that the signature of the link …
In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni, Florens, Mellor, Melvin, Conway, Toffoli, Friedl, and others to compute other link …
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…
We describe several configurations of clasped ropes which are balanced and thus critical for the Gehring ropelength problem of arXiv:math.DG/0402212.
We introduce the notion of a ribbon-clasp surface-link, which is a generalization of a ribbon surface-link. We generalize the notion of a normal form on embedded surface-links to the case of immersed surface-links and prove that any (immersed) surface-link can be described in a normal form. It is known that an embedded…
Complete classification of links up to specific moves.
We analyze transverse doubled knots in the standard contact 3-space by using spanned clasp disks. As applications, we will estimate their self-linking number and furthermore we will show that in many cases, transverse twist knots with the maximal self-linking number are unique up to transverse isotopy.
Study knot invariants to answer questions about slice genus and clasp numbers.
The paper generalizes the -genus to characterize slice knots and slice genus.
Paper extends link Floer homology detection to almost braided links.
We show that the clasps in the Karoubi envelope of spider satisfy the recursive formula of the two-variable Chebyshev polynomials of the second kind associated with a root system of type . The spider is a diagrammatic description of the representation category for and the $…
We study some properties of decomposable exact Lagrangian cobordisms between Legendrian links in with the standard contact structure. In particular, for any decomposable exact Lagrangian filling of a Legendrian link , we may obtain a normal ruling of associated with . We prove that the asso…
We show that an immersed thrice-punctured sphere in a cusped orientable hyperbolic 3-manifold is either embedded or has a single clasp in a manifold obtained by hyperbolic Dehn filling on a cusp of the Whitehead link complement.
New knots found that are 4-genus minimal.
The main purpose of this paper is to provide an infinite family of counter examples of the open problem mentioned in [2]. In particular, we present an infinite family of a particular Legendrian -torus knot, for each , which has only 1 normal ruling, but do not satisfy the even number of clasps co…
Kuperberg introduced web spaces for some Lie algebras which are generalizations of the Kauffman bracket skein module on a disk with marked points. We derive some formulas for and clasped web spaces by graphical calculus using skein theory. These formulas are colored version of skein relations, twist formula…
We study the effect of satellite operations on the Upsilon invariant of Ozsvath-Stipsicz-Szabo. We obtain results concerning when a knot and its satellites are independent; for example, we show that the set is a basis for an infinite rank summand of the group of smooth concordance classes o…
The Kauffman-Vogel polynomials are three variable polynomial invariants of -valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented -valent rigid vertex graphs was given by using the Kauffman bracket and the Jones-Wenzl idempotent colored with . Bataineh, Elha…
We show that Khovanov homology (and its sl(3) variant) can be understood in the context of higher representation theory. Specifically, we show that the combinatorially defined foam constructions of these theories arise as a family of 2-representations of categorified quantum sl(m) via categorical skew Howe duality. Uti…
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
In this paper we study the knot Floer homology invariants of the twisted and untwisted Whitehead doubles of an arbitrary knot K. We present a formula for the filtered chain homotopy type of HFK(D(+,K,t)) in terms of the invariants for K, where D(+,K,t) denotes the t-twisted positive-clasped Whitehead double of K. In pa…
This note explains how to transform Heegaard diagrams into framed link diagrams.
We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products fall into a single family, and prove that the size of this family grows linearly …
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.