Volume 14, issue 5 (2014)

Download this article
Download this article For screen
For printing
Recent Issues

Volume 18
Issue 4, 1883–2507
Issue 3, 1259–1881
Issue 2, 635–1258
Issue 1, 1–633

Volume 17, 6 issues

Volume 16, 6 issues

Volume 15, 6 issues

Volume 14, 6 issues

Volume 13, 6 issues

Volume 12, 4 issues

Volume 11, 5 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 4 issues

Volume 7, 4 issues

Volume 6, 5 issues

Volume 5, 4 issues

Volume 4, 2 issues

Volume 3, 2 issues

Volume 2, 2 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Editorial Interests
Editorial Procedure
Submission Guidelines
Submission Page
Author Index
To Appear
ISSN (electronic): 1472-2739
ISSN (print): 1472-2747
The $(n)$–solvable filtration of link concordance and Milnor's invariants

Carolyn Otto

Algebraic & Geometric Topology 14 (2014) 2627–2654

We establish several new results about both the (n)–solvable filtration of the set of link concordance classes and the (n)–solvable filtration of the string link concordance group, Cm. The set of (n)–solvable m–component string links is denoted by nm. We first establish a relationship between Milnor’s invariants and links, L, with certain restrictions on the 4–manifold bounded by ML, the zero-framed surgery of  S3 on L. Using this relationship, we can relate (n)–solvability of a link (or string link) with its Milnor’s μ̄–invariants. Specifically, we show that if a link is (n)–solvable, then its Milnor’s invariants vanish for lengths up to 2n+2 1. Previously, there were no known results about the “other half” of the filtration, namely n.5mn+1m. We establish the effect of the Bing doubling operator on (n)–solvability and using this, we show that n.5mn+1m is nontrivial for links (and string links) with sufficiently many components. Moreover, we show that these quotients contain an infinite cyclic subgroup. We also show that links and string links modulo (1)–solvability is a nonabelian group. We show that we can relate other filtrations with Milnor’s invariants. We show that if a link is n–positive, then its Milnor’s invariants will also vanish for lengths up to 2n+2 1. Lastly, we prove that the grope filtration of the set of link concordance classes is not the same as the (n)–solvable filtration.

Milnor's invariants, solvable filtration, link concordance
Mathematical Subject Classification 2010
Primary: 57M25
Received: 8 February 2013
Revised: 9 December 2013
Accepted: 12 December 2013
Published: 5 November 2014
Carolyn Otto
Department of Mathematics
University of Wisconsin-Eau Claire
1428 Bell Street
Eau Claire, WI 54703