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

118237355473 · Jun 202019922001200920172026
48 results for unknotting number conjecture

A counterexample disproves the unknotting number conjecture for a specific knot combination.

problem Disproving the unknotting number conjecture for a particular knot combination.
method Used Snappy to discover and verify a counterexample.
result A counterexample showing u(71#71)5u(7_1\#\overline{7_1})\leq 5 disproves the conjecture.

Adding an unknot to any link equals its bridge number and meridional rank.

problem Proving the Meridional Rank Conjecture for any link.
method Embedding an unknot in a link's complement to achieve the conjecture and proving it for new families of links.
result Bridge numbers and meridional ranks are equal for any link and its unknot.

We show that there is a knot satisfying the property that for each minimal crossing number diagram of the knot and each single crossing of the diagram, changing the crossing results in a diagram for a knot whose unknotting number is at least that of the original knot, thus giving a counterexample to the Bernhard-Jablan…

2017-05-17abs ↗pdf ↗

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being unknotted with resp…

2010-12-18abs ↗pdf ↗

We prove new results about unknotting fibered positive knots and braids.

problem Proving the unknotting number equals genus for fibered positive knots and braids.
method Analyzing positive braid diagrams and fibered positive knots, proving new constraints and conjectures.
result We found fibered positive knots that cannot be unknotted optimally, contradicting Stoimenow's conjecture.

We show how the signed evaluations of link polynomials can be used to calculate unknotting numbers. We use the Jones-Rong value of the Brandt-Lickorish-Millett-Ho polynomial Q to calculate the unknotting numbers of 8_{16}, 9_{49} and 6 further new entries in Kawauchi's tables. Another method is developed by applying an…

2004-05-05abs ↗pdf ↗

We provide a partial classification of the 3-strand pretzel knots K=P(p,q,r)K = P(p,q,r) with unknotting number one. Following the classification by Kobayashi and Scharlemann-Thompson for all parameters odd, we treat the remaining families with rr even. We discover that there are only four possible subfamilies which may satis…

2011-09-21abs ↗pdf ↗

The only knots that are tunnel number one and genus one are those that are already known: 2-bridge knots obtained by plumbing together two unknotted annuli and the satellite examples classified by Eudave-Munoz and by Morimoto-Sakuma. This confirms a conjecture first made by Goda and Teragaito.

2001-06-04abs ↗pdf ↗

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed their Jones polynomials by a divide-and-conquer method, and tested those with triv…

2016-06-21abs ↗pdf ↗

It has been conjectured that for knots KK and KK' in S3S^3, $w(K#K')= w(K)+w(K')-2$. Scharlemann and Thompson have proposed potential counterexamples to this conjecture. For every nn, they proposed a family of knots Kin{K^n_i} for which they conjectured that $w(B^n#K^n_i)=w(K^n_i)$ where BnB^n is a bridge number nn

2009-08-27abs ↗pdf ↗

The Knight Move Conjecture claims that the Khovanov homology of any knot decomposes as direct sums of some "knight move" pairs and a single "pawn move" pair. This is true for instance whenever the Lee spectral sequence from Khovanov homology to Q^2 converges on the second page, as it does for all alternating knots and …

2018-09-26abs ↗pdf ↗

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.