2000 character limit reached
Virtual Parity Alexander Polynomial
Published 19 Jul 2019 in math.GT and math.GN | (1907.08709v1)
Abstract: In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant demonstrates that many virtual knots can not be unknotted by crossing change on only odd crossings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
