A Novel Aprroach to Knot Classification
Charilaos Aneziris
Abstract
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical aspects related to running these algorithms as computer programs. Further on, we reach a solution by improving on the efficiency of these algorithms, and by introducing new ones.
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