Is a Knot Classification possible?
q-alg
2008-02-03 v3 alg-geom
高能物理 - 理论
代数几何
量子代数
摘要
The 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.
引用
@article{arxiv.q-alg/9501022,
title = {Is a Knot Classification possible?},
author = {Charilaos Aneziris},
journal= {arXiv preprint arXiv:q-alg/9501022},
year = {2008}
}
备注
32 pages and 28 figures (figures available upon request), plain TEX