Abelian quotients of the string link monoid
Abstract
The set SL(n) of n-string links has a monoid structure, given by the stacking product. When considered up to concordance, SL(n) becomes a group, which is known to be abelian only if n=1. In this paper, we consider two families of equivalence relations which endow SL(n) with a group structure, namely the Ck-equivalence introduced by Habiro in connection with finite type invariants theory, and the Ck-concordance, which is generated by Ck-equivalence and concordance. We investigate under which condition these groups are abelian, and give applications to finite type invariants.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.