1994/09/10 by Charilaos Aneziris, Aneziris, Charilaos
Engineering · Mathematics · Physics and Astronomy · #Architecture and Computational Design #Design Education and Practice #FOS: Mathematics #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Mechanics and Biomechanics Studies #Quantum Algebra (math.QA) #hep-th #math.QA
paper · pdf · doi:10.48550/arxiv.hep-th/9409055
7 pages, Talk given at the 28th International Symposium on the Theory of Elementary Particles, Wendisch-Rietz, August 30-September 3, 1994
arxiv created 1994/09/10 · openalex publication_date 1994/09/10 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.