Search arXivSearch

arXiv · math/0206258

Noncommutative knot theory

Abstract

The classical abelian invariants of a knot are the Alexander module, which is the first homology group of the the unique infinite cyclic covering space of S^3-K, considered as a module over the (commutative) Laurent polynomial ring, and the Blanchfield linking pairing defined on this module. From the perspective of the knot group, G, these invariants reflect the structure of G^(1)/G^(2) as a module over G/G^(1) (here G^(n) is the n-th term of the derived series of G). Hence any phenomenon associated to G^(2) is invisible to abelian invariants. This paper begins the systematic study of invariants associated to solvable covering spaces of knot exteriors, in particular the study of what we call the n-th higher-order Alexander module, G^(n+1)/G^(n+2), considered as a Z[G/G^(n+1)$-module. We show that these modules share almost all of the properties of the classical Alexander module. They are torsion modules with higher-order Alexander polynomials whose degrees give lower bounds for the knot genus. The modules have presentation matrices derived either from a group presentation or from a Seifert surface. They admit higher-order linking forms exhibiting self-duality. There are applications to estimating knot genus and to detecting fibered, prime and alternating knots. There are also surprising applications to detecting symplectic structures on 4-manifolds. These modules are similar to but different from those considered by the author, Kent Orr and Peter Teichner and are special cases of the modules considered subsequently by Shelly Harvey for arbitrary 3-manifolds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tim D. Cochran. 2004-06-25. Noncommutative knot theory. https://doi.org/10.2140/agt.2004.4.347

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT