1987
DOI: 10.1017/s0305004100067323
|View full text |Cite
|
Sign up to set email alerts
|

The growth of the number of prime knots

Abstract: A fundamental and interesting question in knot theory is:Question 1. How many prime knots of n crossings are there ?Over time, knot theorists have answered this question for n ≤ 13 by the method of exhaustion: one writes down a list of all possible knots of n crossings, and then works hard to eliminate duplications from the list [12]. A perhaps easier question is the following:

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
72
0

Year Published

1996
1996
2017
2017

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(73 citation statements)
references
References 6 publications
1
72
0
Order By: Relevance
“…It is known that there are exponentially many knots with n crossings (Ernst and Sumners 1987;Welsh 1991;Carl Sundberg and Morwen Thistlethwaite 1998), but the exact count is known only for small n (Jim Hoste et al 1998). The difficulties in recognition and enumeration of n-crossing knots make this model less suitable for precise computations, though it is known that most knots are not rational (Ernst and Sumners 1987), nor are most links alternating (Thistlethwaite 1998).…”
Section: The Knot Table Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…It is known that there are exponentially many knots with n crossings (Ernst and Sumners 1987;Welsh 1991;Carl Sundberg and Morwen Thistlethwaite 1998), but the exact count is known only for small n (Jim Hoste et al 1998). The difficulties in recognition and enumeration of n-crossing knots make this model less suitable for precise computations, though it is known that most knots are not rational (Ernst and Sumners 1987), nor are most links alternating (Thistlethwaite 1998).…”
Section: The Knot Table Modelmentioning
confidence: 99%
“…The difficulties in recognition and enumeration of n-crossing knots make this model less suitable for precise computations, though it is known that most knots are not rational (Ernst and Sumners 1987), nor are most links alternating (Thistlethwaite 1998).…”
Section: The Knot Table Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…9 For small values of the MCN there are not many knots or catenanes with a given value. However, the number of knots and catenanes with MCN = n grows exponentially as a function of n, 74 and there are 1,701,936 knots with MCN ≤ 16. 10 So knowing the MCN is not sufficient to determine the knot or catenane.…”
Section: Discussionmentioning
confidence: 99%
“…(We will in the following observe that the results of §3 suggest a similar(ly bad) situation for any fixed genus.) That there are exponentially many genus one knots for bounded crossing number follows from the fact that the Whitehead doubles of distinct knots are distinct, their crossing number is linearly bounded in the crossing number of their companion and that the number of knots of given crossing number has an exponential lower bound [11]. (On the other hand, there are at most exponentially many knots of fixed crossing number at all [35].)…”
Section: Conjecture 51 There Is No Primitive Vassiliev Invariant Vamentioning
confidence: 99%