4:00 pm Friday, April 8, 2011
Thesis Defense: The (n)-solvable filtration of the link concordance group and Milnor's μ-invariants
by Carolyn Otto (Rice University) in HB 427
We establish several new results about the (n)-solvable filtration, {F mn }, of the string link concordance group Cm. 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 F mn.5 / F mn+1 , 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, G mn of Cm is not the same as the (n)-solvable filtration. Host Department: Rice University-Mathematics Submitted by mathweb@rice.edu |