Is a Knot Classification possible?
Charilaos Aneziris
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.
Create a lesson
Related papers
Coherence Constraints for Operads, Categories and Algebras
Martin Markl, Steve Shnider
Affine Sergeev Algebra and q-Analogues of the Young Symmetrizers for Projective Representations of the Symmetric Group
Andrew Jones, Maxim Nazarov
Nonsymmetric Koornwinder polynomials and duality
Siddhartha Sahi
Capelli Identities for Classical Lie Algebras
Alexander Molev, Maxim Nazarov
On modules associated to coalgebra Galois extensions
Tomasz Brzezinski
Web bases for sl(3) are not dual canonical
Mikhail Khovanov, Greg Kuperberg