Dissertation/Thesis Abstract

Computational search for nontrivial knots with unit Jones polynomial
by Tuzun, Robert Erol, M.A., State University of New York at Buffalo, 2009, 173; 1474196
Abstract (Summary)

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.

Indexing (document details)
Advisor: Sikora, Adam S.
Commitee:
School: State University of New York at Buffalo
Department: Mathematics
School Location: United States -- New York
Source: MAI 48/04M, Masters Abstracts International
Source Type: DISSERTATION
Subjects: Mathematics
Keywords: Computational search, Jones polynomial, Unknot
Publication Number: 1474196
ISBN: 978-1-109-62726-8
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest