Yuhong Wu

Publication Date

12-2005

Advisor(s) - Committee Chair

Claus Ernst, Jens Harlander, Dominic Lanphier

Comments

Access granted to WKU students, faculty and staff only.

After an extensive unsuccessful search for the author, this thesis is considered an orphan work, which may be protected by copyright. The inclusion of this orphan work on TopScholar does not guarantee that that orphan work may be used for any purpose and any use of the orphan work may subject the user to a claim of copyright infringement. The reproduction of this work is made by WKU without any purpose of direct or indirect commercial advantage and is made for purposes of preservation and research.

See also WKU Archives - Authorization for Use of Thesis, Special Project & Dissertation

Degree Program

Department of Mathematics

Degree Type

Master of Science

Abstract

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.

Disciplines

Mathematics | Physical Sciences and Mathematics

Download

Share

COinS