We establish several new results about the ( n )-solvable filtration, [Special characters omitted.] , of the string link concordance group [Special characters omitted.] . We first establish a relationship between ( n )-solvability of a link and its Milnor's μ-invariants. We study the effects of the Bing doubling operator on ( n )-solvability. Using this results, we show that the "other half" of the filtration, namely [Special characters omitted.] , is nontrivial and contains an infinite cyclic subgroup for links with sufficiently many components. We will also show that links modulo (1)-solvability is a nonabelian group. Lastly, we prove that the Grope filtration, [Special characters omitted.] of [Special characters omitted.] is not the same as the ( n )-solvable filtration.
| Identifer | oai:union.ndltd.org:RICE/oai:scholarship.rice.edu:1911/70379 |
| Date | January 2011 |
| Contributors | Harvey, Shelly |
| Source Sets | Rice University |
| Language | English |
| Detected Language | English |
| Type | Thesis, Text |
| Format | 69 p., application/pdf |
Page generated in 0.0014 seconds