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

17355269 · Oct 202419922001200920172026
48 results for Jones Unknot Conjecture

Jones-Wenzl projectors lifted to Khovanov spectra, proving knot conjectures.

problem Understanding Jones-Wenzl projectors in Khovanov spectra.
method Constructing and studying lifted projectors via maps and polynomial actions.
result Complete computation of 3-colored Khovanov spectrum of the unknot, proving conjectures.

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 ↗

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.

We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and connected sum.

2008-07-17abs ↗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 ↗

The A-polynomial of a knot in S^3 defines a complex plane curve associated to the set of representations of the fundamental group of the knot exterior into SL(2,C). Here, we show that a non-trivial knot in S^3 has a non-trivial A-polynomial. We deduce this from the gauge-theoretic work of Kronheimer and Mrowka on SU_2-…

2004-05-18abs ↗pdf ↗

Using the recent Gauss diagram formulas for Vassiliev invariants of Polyak-Viro-Fiedler and combining these formulas with the Bennequin inequality, we prove several inequalities for positive knots relating their Vassiliev invariants, genus and degrees of the Jones polynomial. As a consequence, we prove that for any of …

1998-05-18abs ↗pdf ↗

New findings on Jones polynomial for 4-strand braids.

problem Whether there are non-trivial knots with trivial Jones polynomial.
method Study of 4-strand braids, exploration of various properties of hypothetical HOMFLY-PT polynomials.
result Existence of a 1-parameter family of 2-variable polynomials that can be HOMFLY-PT polynomials of some knots.

Paper connects AJ conjecture and colored Jones polynomial potential function.

problem Relationship between AA-polynomial and colored Jones polynomial.
method Connects AJ conjecture and colored Jones polynomial potential function.
result Establishes connection between AA-polynomial and colored Jones polynomial potential function.

In previous joint work with Frohman and Lofaro a noncommutative generalization of the A-polynomial of a knot was introduced, consisting of a finitely generated ideal of polynomials (the noncommutative A-ideal) in the quantum plane. The present paper shows that the noncommutative A-ideal of a knot, together with finitel…

2000-04-25abs ↗pdf ↗

We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I will describe a computer algorithm to search for such a braid.

2000-12-12abs ↗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.

Paper proves knots satisfy a conjecture using Jones polynomial.

problem Proving infinite families of knots satisfy the Cosmetic Surgery Conjecture.
method Computed Jones polynomial and invariants for two knot families.
result Two infinite families of knots satisfy the Purely Cosmetic Surgery Conjecture.

We compute the unknotting number of two infinite families of pretzel knots, P(3,1,,1,b)P(3,1,\dots,1,b) (with bb positive and odd and an odd number of 1s) and P(3,3,3c)P(3,3,3c) (with cc positive and odd). To do this, we extend a technique of Owens using Donaldson's diagonalization theorem, and one of Traczyk using the Jones polynom…

2013-12-16abs ↗pdf ↗

This is a recreational paper showing that certain linked graphs cannot be separated. The proofs employ elementary covering space theory, an appeal to a theorem of Scharlemann (concerning the band sums of two unknots), and a Jones polynomial calculation.

2004-12-24abs ↗pdf ↗

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.

We continue the study of the genus of knot diagrams, deriving a new description of generators using Hirasawa's algorithm. This description leads to good estimates on the maximal number of crossings of generators and allows us to complete their classification for knots of genus 4. As applications of the genus 4 classifi…

2011-01-18abs ↗pdf ↗

Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We verify this conjecture for adequate knots, a class that vastly generalizes that o…

2010-02-01abs ↗pdf ↗

The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov volume vanish.

2015-01-06abs ↗pdf ↗