Using Twisted Alexander Polynomials to Detect Fiberdness
classification
🧮 math.GT
keywords
alexandergraphknotpolynomialstwistedbuildcomponentdetect
read the original abstract
In this paper we use twisted Alexander polynomials to prove that the exterior of a particular graph knot is not fibered. Then we build three 2-component graph links out of this knot, and use similar techniques to discuss their fiberedness.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.