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 clasp diagrams

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

problem Calculating bridge indices for spatial graphs efficiently.
method Extending Wirtinger number to spatial graphs, implementing Python algorithm, combining algebraic structures and clasping techniques.
result Exact bridge indices for almost unknotted graphs of large bridge index.

The clasp number c(K)c(K) of a knot KK is the minimum number of clasp singularities among all clasp disks bounded by KK. It is known that the genus g(K)g(K) and the unknotting number u(K)u(K) are lower bounds of the clasp number, that is, max{g(K),u(K)}c(K)\max\{g(K),u(K)\} \leq c(K). Then it is natural to ask whether there exists a knot …

2014-05-01abs ↗pdf ↗

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 …

2009-04-27abs ↗pdf ↗

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 …

2019-07-29abs ↗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 ↗

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…

2016-02-25abs ↗pdf ↗

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.

2005-05-02abs ↗pdf ↗

Study knot invariants to answer questions about slice genus and clasp numbers.

problem Whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large.
method Equivariant singular instanton theory and Chern--Simons functional.
result Answers a conjecture by Livingston about slicing numbers and provides a lower bound for the unoriented slice genus.

The paper generalizes the TT-genus to characterize slice knots and slice genus.

problem Characterizing slice knots and slice genus using the TT-genus.
method Generalizing the TT-genus to provide a 33-dimensional characterization of the slice genus.
result The difference between the TT-genus and the slice genus can be arbitrarily large.

We study some properties of decomposable exact Lagrangian cobordisms between Legendrian links in R3\mathbb{R}^3 with the standard contact structure. In particular, for any decomposable exact Lagrangian filling LL of a Legendrian link KK, we may obtain a normal ruling of KK associated with LL. We prove that the asso…

2015-12-26abs ↗pdf ↗

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.

2008-02-19abs ↗pdf ↗

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 (4,(2n+5))(4,-(2n+5))-torus knot, for each n0n \geq 0, which has only 1 normal ruling, but do not satisfy the even number of clasps co…

2015-12-26abs ↗pdf ↗

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 {D2i,1}i=1\{D_{2^i,1}\}_{i=1}^\infty is a basis for an infinite rank summand of the group of smooth concordance classes o…

2016-04-17abs ↗pdf ↗

The Kauffman-Vogel polynomials are three variable polynomial invariants of 44-valent rigid vertex graphs. A one-variable specialization of the Kauffman-Vogel polynomials for unoriented 44-valent rigid vertex graphs was given by using the Kauffman bracket and the Jones-Wenzl idempotent colored with 22. Bataineh, Elha…

2017-08-30abs ↗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.

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…

2006-06-05abs ↗pdf ↗

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.