Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Geometric Topology

arXiv:1804.09780 (math)
[Submitted on 25 Apr 2018 (v1), last revised 27 Apr 2018 (this version, v2)]

Title:On the Structure and Scarcity of Alternating Knots

Authors:Harrison Chapman
View PDF
Abstract:Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare. This is currently the best possible analogue of a pair of theorems on alternating links of Sundberg and Thistlethwaite in 1998 and Thistlethwaite in 1998, given the current obstructions to an exact enumeration of knot diagrams. We also discuss implications of this pattern theorem for subknots and slipknots in minimal alternating knot diagrams and types, partially answering a conjecture of Millett and Jablan.
Comments: 15 pages, 13 figures. This version corrects a typo in the statement of the main theorem
Subjects: Geometric Topology (math.GT); Combinatorics (math.CO)
Cite as: arXiv:1804.09780 [math.GT]
  (or arXiv:1804.09780v2 [math.GT] for this version)
  https://doi.org/10.48550/arXiv.1804.09780

Submission history

From: Harrison Chapman [view email]
[v1] Wed, 25 Apr 2018 20:04:36 UTC (194 KB)
[v2] Fri, 27 Apr 2018 15:21:31 UTC (194 KB)
Full-text links:

Access Paper:

view license
Current browse context:
math.GT
< prev   |   next >
new | recent | 2018-04
Change to browse by:
math
math.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)