Advisor(s) - Committee Chair
Claus Ernst, Jens Harlander, Dominic Lanphier
Department of Mathematics
Master of Science
The cubic lattice is a graph in R3 whose vertices are all points with coordinates (x, y, z) where x, y, z are integers and whose edges are line segments of unit length connecting two vertices. This thesis addresses how many edges of the cubic lattice are needed to realize a given link. The main theorem proves that two six crossing links, denoted 623, 633 and one eight crossing link, denoted 843, need a minimum of 36, 34, and 40 edges respectively.
Mathematics | Physical Sciences and Mathematics
Wu, Yuhong, "Knots & Links on the Cubic Lattice" (2005). Masters Theses & Specialist Projects. Paper 3458.