Is a Knot Classification possible?
Abstract
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed self-avoiding walks.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.