skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Big data approaches to knot theory: Understanding the structure of the Jones polynomial
In this paper, we examine the properties of the Jones polynomial using dimensionality reduction learning techniques combined with ideas from topological data analysis. Our data set consists of more than 10 million knots up to 17 crossings and two other special families up to 2001 crossings. We introduce and describe a method for using filtrations to analyze infinite data sets where representative sampling is impossible or impractical, an essential requirement for working with knots and the data from knot invariants. In particular, this method provides a new approach for analyzing knot invariants using Principal Component Analysis. Using this approach on the Jones polynomial data, we find that it can be viewed as an approximately three-dimensional subspace, that this description is surprisingly stable with respect to the filtration by the crossing number, and that the results suggest further structures to be examined and understood.  more » « less
Award ID(s):
1854705
PAR ID:
10442729
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Journal of Knot Theory and Its Ramifications
Volume:
31
Issue:
13
ISSN:
0218-2165
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. The slope conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of essential surfaces. We develop a general approach that matches a state-sum formula for the colored Jones polynomial with the parameters that describe surfaces in the complement. We apply this to Montesinos knots proving the slope conjecture for Montesinos knots, with some restrictions. 
    more » « less
  2. null (Ed.)
    We observe that the strong slope conjecture implies that the degree of the colored Jones polynomial detects all torus knots. As an application we obtain that an adequate knot that has the same colored Jones polynomial degrees as a torus knot must be a $(2,q)$-torus knot. 
    more » « less
  3. We obtain a formula for the Turaev-Viro invariants of a link complement in terms of values of the colored Jones polynomial of the link. As an application we give the first examples for which the volume conjecture of Chen and the third named author\,\cite{Chen-Yang} is verified. Namely, we show that the asymptotics of the Turaev-Viro invariants of the Figure-eight knot and the Borromean rings complement determine the corresponding hyperbolic volumes. Our calculations also exhibit new phenomena of asymptotic behavior of values of the colored Jones polynomials that seem not to be predicted by neither the Kashaev-Murakami-Murakami volume conjecture and various of its generalizations nor by Zagier's quantum modularity conjecture. We conjecture that the asymptotics of the Turaev-Viro invariants of any link complement determine the simplicial volume of the link, and verify it for all knots with zero simplicial volume. Finally we observe that our simplicial volume conjecture is stable under connect sum and split unions of links. 
    more » « less
  4. null (Ed.)
    We point out that the strong slope conjecture implies that the degrees of the colored Jones knot polynomials detect the figure eight knot. Furthermore, we propose a characterization of alternating knots in terms of the Jones period and the degree span of the colored Jones polynomial. 
    more » « less
  5. Goaoc, Xavier; Kerber, Michael (Ed.)
    A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by planar diagrams, whereas their exteriors, which are compact 3-manifolds with torus boundary, are encoded by triangulations. Here, we give the first practical algorithm for finding a diagram of a knot given a triangulation of its exterior. Our method applies to links as well as knots, allows us to recover links with hundreds of crossings. We use it to find the first diagrams known for 23 principal congruence arithmetic link exteriors; the largest has over 2,500 crossings. Other applications include finding pairs of knots with the same 0-surgery, which relates to questions about slice knots and the smooth 4D PoincarĂ© conjecture. 
    more » « less