2000 character limit reached
Solvability of concordance groups and Milnor invariants
Published 4 Dec 2023 in math.GT | (2312.02058v1)
Abstract: Using Milnor invariants, we prove that the concordance group $\mathcal{C}(2)$ of $2$-string links is not solvable. As a consequence we prove that the equivariant concordance group of strongly invertible knots is also not solvable, and we answer a conjecture posed by Kuzbary.
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.