2019
DOI: 10.48550/arxiv.1912.10086
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Big Data Approaches to Knot Theory: Understanding the Structure of the Jones Polynomial

Abstract: We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques. 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 an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Nevertheless, due to supersymmetric localization, there is a classical solution of the supersymmetric equations with the appropriate quantum numbers; what we cannot say is whether this solution is unique or if there are others which complicate the limit. 21 As well, [35,36] study many of the same invariants we do from dimensionality reduction and topological data analysis perspectives.…”
Section: Methodsmentioning
confidence: 99%
“…Nevertheless, due to supersymmetric localization, there is a classical solution of the supersymmetric equations with the appropriate quantum numbers; what we cannot say is whether this solution is unique or if there are others which complicate the limit. 21 As well, [35,36] study many of the same invariants we do from dimensionality reduction and topological data analysis perspectives.…”
Section: Methodsmentioning
confidence: 99%
“…While trying to compare different approaches to building ensembles of closures for open arcs, we were struck by the similarity to a problem in machine learning: design a classifier which predicts the knot type of a closed polygon P given a subarc A of that polygon (for some existing machine learning approaches to knot classification, see [20,22,25,27,41]). In this paper, we will focus on equilateral closed polygons chosen from the uniform 1 probability measure [6,8] on such polygons.…”
Section: Introductionmentioning
confidence: 99%