Towards a Classification of Knots

Simple item page
dc.creatorAneziris, Charilaos
dc.date1994-09-10
dc.date.accessioned2026-07-07T09:14:23Z
dc.date.available2026-07-07T09:14:23Z
dc.descriptionWe 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.
dc.description7 pages, Talk given at the 28th International Symposium on the Theory of Elementary Particles, Wendisch-Rietz, August 30-September 3, 1994
dc.identifierhttps://arxiv.org/abs/hep-th/9409055
dc.identifierhttp://arxiv.org/abs/hep-th/9409055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152656
dc.subjectHigh Energy Physics - Theory
dc.subjectQuantum Algebra
dc.titleTowards a Classification of Knots
dc.typetext

Files

Collections

arXiv