Is a Knot Classification possible?

Simple item page
dc.creatorAneziris, Charilaos
dc.date1995-01-18
dc.date1995-01-20
dc.date.accessioned2026-07-07T09:04:49Z
dc.date.available2026-07-07T09:04:49Z
dc.descriptionThe goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed self-avoiding walks.
dc.description32 pages and 28 figures (figures available upon request), plain TEX
dc.identifierhttps://arxiv.org/abs/q-alg/9501022
dc.identifierhttp://arxiv.org/abs/q-alg/9501022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/149520
dc.subjectQuantum Algebra
dc.subjectAlgebraic Geometry
dc.subjectHigh Energy Physics - Theory
dc.titleIs a Knot Classification possible?
dc.typetext

Files

Collections

arXiv