2017/05/29 by Andrey Boris Khesin, Khesin, Andrey Boris
Mathematics · #Advanced Combinatorial Mathematics #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Homotopy and Cohomology in Algebraic Topology
paper · pdf · doi:10.48550/arxiv.1705.10319
openalex publication_date 2017/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J. Hoste, M. Thistlethwaite, and J. Weeks in [1]. The difference between our methods comes from the fact that [1] uses a more complicated algorithm to be able to find all the knots with up to 17 crossings, while our approach demonstrates a simpler way to find the knots up to 10 crossings. We do this by generating all planar knot diagrams with up to 10 crossings and applying several simplifications to group the knot diagrams into equivalence classes. From these classes, we generate the full list of candidate knots and reduce it with several sets of moves. Lastly, we use invariants to show that each of the 250 diagrams generated is distinct, proving that there are exactly 250 knots with 10 crossings or fewer. Though the algorithms used could be made more efficient, readability was chosen over speed for simplicity and reproducibility.