Enumerating the Prime Alternating Knots, Part II

Details Enumerating the Prime Alternating Knots, Part II Enumerating the Prime Alternating Knots, Part II

2002-11-22

arxiv.org/abs/math/0211348v1

Mathematics

Geometric Topology

Scientific paper

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. In this paper, we explain how to actually implement the operators in an efficient manner. This relies on a complete invariant that we have introduced, called the master array for a prime alternating knot. By December 1, 1999, we had successfully run an early implementation of the algorithms described in Part II on the UWO Compaq ES-40 48 node beowulf cluster to produce the 40,619,385 prime alternating knots of 19 crossings. At that time, we did not utilize memory very efficiently, and we were not able to continue further, since the number of prime alternating knots is increasing roughly by a factor of 5 with each increase in crossing size at these levels. We have subsequently made very big improvements both in memory utilization and in the amount of work that must be done.

Affiliated with

Also associated with

No associations

Rating

Enumerating the Prime Alternating Knots, Part II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating the Prime Alternating Knots, Part II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating the Prime Alternating Knots, Part II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162374