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

113227340453 · Jun 202019922001200920172026
48 results for rational unknotting number

The paper calculates bounds for unknotting rational tangles using knot Floer homology.

problem Calculating the minimum number of rational replacements to unknot a tangle.
method From the link Floer complex, extract a lower bound for the rational unknotting number using knot Floer homology.
result The torsion obstruction is a lower bound for the proper rational unknotting number.

We use the rational Witt class of a knot in the 3-sphere as a tool for addressing questions about its unknotting number. We apply these tools to several low crossing knots (151 knots with 11 crossing and 100 knots with 12 crossings) and to the family of n-stranded pretzel knots for various values of n>2. In many cases …

2009-07-14abs ↗pdf ↗

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings in terms of their generating functions. We show in particular how Fibonacci numb…

2002-10-11abs ↗pdf ↗

The paper constructs new rational homology 3-spheres bounding rational homology 4-balls.

problem Constructing rational homology 3-spheres that bound rational homology 4-balls.
method Exploring plumbed 3-manifolds and using rational homology circles.
result Infinite families of rational homology 3-spheres that bound rational homology 4-balls.

Introducing a way to modify knots using nn-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and Yamada). The same result is shown for 4-genera and finite reductions of the homolog…

1999-09-09abs ↗pdf ↗

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove theorems characterizing when the numerator of the sum of two rational tangles is…

2006-01-22abs ↗pdf ↗

The surgery unknotting number of a Legendrian link is defined as the minimal number of particular oriented surgeries that are required to convert the link into a Legendrian unknot. Lower bounds for the surgery unknotting number are given in terms of classical invariants of the Legendrian link. The surgery unknotting nu…

2012-06-27abs ↗pdf ↗

In the note we study Legendrian and transverse knots in rationally null-homologous knot types. In particular we generalize the standard definitions of self-linking number, Thurston-Bennequin invariant and rotation number. We then prove a version of Bennequin's inequality for these knots and classify precisely when the …

2009-01-04abs ↗pdf ↗

We consider the recently introduced knotting-unknotting game, in which two players take turns resolving crossings in a knot diagram which initially is missing all its crossing information. Once the knot is fully resolved, the winner is decided by whether the knot is equivalent to the unknot. In this paper we determine …

2011-07-13abs ↗pdf ↗

We classify Legendrian rational unknots with tight complements in the lens spaces L(p,1) up to coarse equivalence. As an example of the general case, this classification is also worked out for L(5,2). The knots are described explicitly in a contact surgery diagram of the corresponding lens space.

2013-02-15abs ↗pdf ↗

We examine certain symmetries in the deficiencies of a rational surgery on a knot in S3S^3 by comparing the Spinc\text{Spin}^c-structures on the rational surgery with those on a related integral surgery. We then provide an application of these symmetries in the form of a theorem that obstructs Dehn surgeries in S3S^3. Thi…

2013-04-01abs ↗pdf ↗

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking number. We compute BJ-unlinking number for various families of knots and links for w…

2005-03-14abs ↗pdf ↗

We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category which are topologically slice. We also give generalizations regarding components of…

2011-03-12abs ↗pdf ↗

Boring is an operation which converts a knot or two-component link in a 3--manifold into another knot or two-component link. It generalizes rational tangle replacement and can be described as a type of 2--handle attachment. Sutured manifold theory is used to study the existence of essential spheres and planar surfaces …

2007-09-26abs ↗pdf ↗

Study contact structures on specific manifolds, proving infinite non-isotopic structures and tight/overtwisted classifications.

problem Classifying contact structures with specific contact surgery numbers on Brieskorn spheres and lens spaces.
method Algorithm for computing Euler class from rational contact surgery, Legendrian knot classification, and analysis of contact structures.
result Infinitely many non-isotopic contact structures on Brieskorn spheres and lens spaces cannot be obtained by a single rational contact surgery.

Study tangle equations linking enzyme actions to knot theory.

problem Proving the Jones Unknot conjecture and understanding tangle solutions.
method Analyzing framed tangle equations and introducing Kauffman bracket ratios.
result Unique rational solutions for tangle equations imply the Jones Unknot conjecture.

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.

Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let gg be an embedding of a planar graph GG, then we show u(g)max{u(s)u(g) \geq \max\{u(s) | ss is a non-overl…

2017-10-14abs ↗pdf ↗

The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the unknotting number can be obtained from any one diagram of the knot. To do this we…

2013-03-28abs ↗pdf ↗

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The second part concerns an explicit form of composite links with H(2)-unknotting nu…

2011-04-22abs ↗pdf ↗

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on alternating 3-braid knots is sufficient to identify all unknotting number one alte…

2013-12-04abs ↗pdf ↗

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.

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

2017-01-15abs ↗pdf ↗

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 ↗

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.

RL pipeline simplifies knot diagrams, including very hard unknots.

problem Simplifying complex knot diagrams, especially very hard unknots.
method Reinforcement learning for move proposals and heuristic navigation of Reidemeister moves.
result Trained agent simplifies diagrams, including a 41#9104_1\#9_{10} link to a three-step unknotting process.

We use Heegaard Floer homology to obtain bounds on unknotting numbers. This is a generalisation of Ozsvath and Szabo's obstruction to unknotting number one. We determine the unknotting numbers of 9_10, 9_13, 9_35, 9_38, 10_53, 10_101 and 10_120; this completes the table of unknotting numbers for prime knots with crossi…

2005-06-23abs ↗pdf ↗