Taylor E. Martin

activity

20152026

most citedClassification of Links Up to 0-Solvability

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2016 · math.GTShow all

2 papers · 2 filters

math.GT2016

Splittings of link concordance groups

Taylor E. Martin, Carolyn Otto

We establish several results about two short exact sequences involving lower terms of the $n$ -solvable filtration, ${F_{n}^{m}}$ of the string link concordance group $\math…

math.GT2016

Every genus one algebraically slice knot is 1-solvable

Christopher W. Davis, Taylor E. Martin, Carolyn Otto +1

Cochran, Orr, and Teichner developed a filtration of the knot concordance group indexed by half integers called the solvable filtration. Its terms are denoted by $F_{n}$ . I…