Classification of Links Up to 0-Solvability
arXiv:1511.00156 · doi:10.1016/j.topol.2022.108158
Abstract
The -solvable filtration of the -component smooth (string) link concordance group, as defined by Cochran, Orr, and Teichner, is a tool for studying smooth knot and link concordance that yields important results in low-dimensional topology. The focus of this paper is to give a characterization of the set of 0-solvable links. We introduce a new equivalence relation on links called 0-solve equivalence and establish both an algebraic and a geometric classification of , the set of links up to 0-solve equivalence. We show that has a group structure isomorphic to the quotient of concordance classes of string links and classify this group, showing that Finally, using results of Conant, Schneiderman, and Teichner, we show that 0-solvable links are precisely the links that bound class 2 gropes and support order 2 Whitney towers in the 4-ball.
arXiv comment34 pages
References in corpus (6)
- Knot Concordance and Higher-Order Blanchfield Duality
- Homology Cobordism Invariants and the Cochran-Orr-Teichner Filtration of the Link Concordance Group
- Knot concordance, Whitney towers and L^2 signatures
- Higher Order Intersections in Low-Dimensional Topology
- Homology and Derived Series of Groups II: Dwyer's Theorem
- The (n)-solvable filtration of the link concordance group and Milnor's invariants