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

Trend · papers per month

109218326435 · Jun 202019922001200920172026
48 results for clasp numbers

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 ↗

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 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 introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather than out of crossings. We describe an equivalence relation on clasp diagrams which…

2019-11-07abs ↗pdf ↗

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.

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

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

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 ↗

The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring complexity. In terms of the core curve, the thickness constraint has two parts: an upper b…

2011-02-16abs ↗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 ↗

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 ↗

Positive surgery on knots in weakly fillable 3-manifolds yields weakly fillable contact structures.

problem Conditions for a knot to admit a fillable positive surgery.
method Contact surgery, symplectic embeddings, and quasipositive knots.
result Conditions for a knot to admit a fillable positive surgery, including quasipositivity and slice genus equality.

Let D(K)D(K) be the positively-clasped untwisted Whitehead double of a knot KK, and Tp,qT_{p,q} be the (p,q)(p,q) torus knot. We show that D(T2,2m+1)D(T_{2,2m+1}) and D2(T2,2m+1)D^2(T_{2,2m+1}) are linearly independent in the smooth knot concordance group C\mathcal{C} for each m2m\geq 2. Further, D(T2,5)D(T_{2,5}) and D2(T2,5)D^2(T_{2,5}) generate a $…

2013-11-08abs ↗pdf ↗

In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy …

2004-02-13abs ↗pdf ↗

In this paper, we study the asymptotics of the colored Jones polynomials of the Whitehead chains with one belt colored by M1M_1 and all the clasps colored by M2M_2 evaluated at the (N+1/2)(N+1/2)-th root of unity t=e2πiN+1/2t=e^{\frac{2πi}{N+1/2}}, where M1M_1 and M2M_2 are sequences of integers in NN. By considering the limiting r…

2019-12-23abs ↗pdf ↗

Intelligent agents can learn to represent the action spaces of other agents simply by observing them act. Such representations help agents quickly learn to predict the effects of their own actions on the environment and to plan complex action sequences. In this work, we address the problem of learning an agent's action…

2018-06-25abs ↗pdf ↗

Study of sp4\mathfrak{sp}_4-webs on surfaces, proving cluster algebra structure.

problem Understanding sp4\mathfrak{sp}_4-webs and their cluster algebra properties.
method Introduced skein algebra and cluster structure, proved positivity.
result Proved Ssp4,ΣZq[1]\mathscr{S}_{\mathfrak{sp}_4,Σ}^{\mathbb{Z}_q}[\partial^{-1}] is a quantum cluster algebra.

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

2015-07-15abs ↗pdf ↗

The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.

problem Bounding the handle number of sutured manifolds.
method Developed bounds on the Morse-Novikov number of a link in terms of its tunnel number, and used these to bound the handle number of Heegaard splittings.
result The handle number function is bounded, constant on rays from the origin, and locally maximal.

New measure shows how links can be untangled as twists increase.

problem Understanding how links can be simplified through repeated twists.
method Introduced the stable unknotting number to analyze links in a twist family.
result The stable unknotting number depends only on the winding number of the link, not the wrapping number.

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist infinitely many positive knots with any dealternating number (or any alternation…

2008-08-05abs ↗pdf ↗

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

Study on knot properties, showing relation between unknotting and crossing numbers.

problem Relations between unknotting and crossing numbers of spatial embeddings.
method Analyzes handcuff-graphs and theta curves, extends known results to handlebody-knots.
result Characterizes handlebody-knots satisfying the equality between unknotting and crossing numbers.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.