This thesis details a strategy for a computational search for a non-trivial knot with trivial Jones polynomial, based in large part on the recent strategy of Yamada. New methods or improvements to existing methods have been found for enumerating trivializable algebraic tangles, for enumerating Conway polyhedra and for eliminating some from consideration, for computing individual Kauffman brackets, and for computing all possible Kauffman brackets given a set of tangles. Many miscellaneous strategies have been found for eliminating certain sets of knots from requiring calculation or for speeding up the calculations.
|Advisor:||Sikora, Adam S.|
|School:||State University of New York at Buffalo|
|School Location:||United States -- New York|
|Source:||MAI 48/04M, Masters Abstracts International|
|Keywords:||Computational search, Jones polynomial, Unknot|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be