Can Computers Discover Ideal Knots?
Rawdon, Eric J.
Experiment. Math., Tome 12 (2003) no. 1, p. 287-302 / Harvested from Project Euclid
We discuss the relationship between polygonal knot energies and smooth knot energies, concentrating on ropelength. We show that a smooth knot can be inscribed in a polygonal knot in such a way that the ropelength values are close. For a given knot type, we show that polygonal ropelength minima exist and that the minimal polygonal ropelengths converge to the minimal ropelength of the smooth knot type. A subsequence of these polygons converges to a smooth ropelength minimum. Thus, ropelength minimizations performed on polygonal knots do, in fact, approximate ropelength minimizations for smooth knots.
Publié le : 2003-05-14
Classification:  Polygonal knots,  geometric knots,  ropelength,  57M25
@article{1087329232,
     author = {Rawdon, Eric J.},
     title = {Can Computers Discover Ideal Knots?},
     journal = {Experiment. Math.},
     volume = {12},
     number = {1},
     year = {2003},
     pages = { 287-302},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1087329232}
}
Rawdon, Eric J. Can Computers Discover Ideal Knots?. Experiment. Math., Tome 12 (2003) no. 1, pp.  287-302. http://gdmltest.u-ga.fr/item/1087329232/