Towards a Classification of Knots
Abstract
Description
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on placing knots on a cubic lattice.
7 pages, Talk given at the 28th International Symposium on the Theory of Elementary Particles, Wendisch-Rietz, August 30-September 3, 1994
7 pages, Talk given at the 28th International Symposium on the Theory of Elementary Particles, Wendisch-Rietz, August 30-September 3, 1994