Spelling suggestions: "subject:"not anda link"" "subject:"not anda sink""
1 |
Matrix Representation of Knot and Link GroupsMay, Jessica 01 May 2006 (has links)
In the 1960s French mathematician George de Rham found a relationship between two invariants of knots. He found that there exist representations of the fundamental group of a knot into a group G of upper right triangular matrices in C with determinant one that is described exactly by the roots of the Alexander polynomial. I extended this result to find that the representations of the fundamental group of a link into G are described by the multivariable Alexander polynomial of the link.
|
2 |
The existence of energy minimizers for knots and linksSargrad, Scott. January 2004 (has links)
Thesis (B.A.)--Haverford College, Dept. of Mathematics, 2004. / Includes bibliographical references.
|
3 |
Link invariants, quantized superalgebras and the Kontsevich integral /Geer, Nathan, January 2004 (has links)
Thesis (Ph. D.)--University of Oregon, 2004. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 123-125). Also available for download via the World Wide Web; free to University of Oregon users.
|
4 |
Khovanov homology and link cobordisms /Jacobsson, Magnus, January 2003 (has links)
Diss. (sammanfattning) Uppsala : Univ., 2003. / Härtill 3 uppsatser.
|
5 |
Lower order solvability of linksMartin, Taylor 16 September 2013 (has links)
The n-solvable filtration of the link concordance group, defined by Cochran, Orr, and Teichner in 2003, is a tool for studying smooth knot and link concordance that yields important results in low-dimensional topology. We focus on the first two stages of the n-solvable filtration, which are the class of 0-solvable links and the class of 0.5-solvable links. We introduce a new equivalence relation on links called 0-solve equivalence and establish both an algebraic and a geometric characterization 0-solve equivalent links. As a result, we completely characterize 0-solvable links and we give a classification of links up to 0-solve equivalence. We relate 0-solvable links to known results about links bounding gropes and Whitney towers in the 4-ball. We then establish a sufficient condition for a link to be 0.5-solvable and show that 0.5-solvable links must have vanishing Sato-Levine invariants.
|
Page generated in 0.4612 seconds