Computer Programs for Knot Tabulation
Charilaos Aneziris
Abstract
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be based. We also present the actual results obtained after running a computer program on which knots are denoted through regular projections.
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