arXiv:2110.03082 [math.GT]AbstractReferencesReviewsResources
The Jones Polynomial from a Goeritz Matrix
Published 2021-10-06, updated 2022-01-06Version 3
We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard surface is orientable, or when more information is known about its Gordon-Litherland form. In the process we develop a theory of Goeritz matrices for cographic matroids, which extends the bracket polynomial to any symmetric integer matrix. We place this work in the context of links in thickened surfaces.
Comments: Version 3: minor correction
Journal: Bull. Long. Math. Soc. 55 (2023), no. 2, 732-755
DOI: 10.1112/blms.12753
Categories: math.GT
Keywords: goeritz matrix, jones polynomial, symmetric integer matrix, link diagram, explicit algorithm
Tags: journal article
Related articles: Most relevant | Search more
Is the Jones polynomial of a knot really a polynomial?
The Jones polynomial of ribbon links
The Jones polynomial and graphs on surfaces