tk-moves on links

Abstract

It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In particular if k=2 and the second link is a trivial link it is the question about the unknotting number. The new polynomial invariants of links often allow us to answer the above questions. Also the first homology groups of cyclic branch covers over links provide some interesting information. In the first part of the paper we apply the Jones-Conway (Homflypt) and Kauffman polynomials to find whether two links are not tk equivalent and if they are, to gain some information how many moves are needed to go from one link to the other. In the second part we describe the Fox congruence classes and their relations with tk moves. We use the Fox method to analyze relations between tk moves and the first homology groups of branched cyclic covers of links.In the third part we consider the influence of tk moves on the Goeritz and Seifert matrices and analyze Lickorish-Millett and Murakami formulas from the point of view of tk moves and illustrate them by various examples. At the end of the paper we outline some relations with signatures of links and non-cyclic coverings of link spaces.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…