SearcharxivSearch

arXiv · 1405.0994

Residual nilpotence and ordering in one-relator groups and knot groups

Abstract

Let $G=< x,t\mid w>$ be a one-relator group, where $w$ is a word in $x,t$. If $w$ is a product of conjugates of $x$ then, associated with $w$, there is a polynomial $A_w(X)$ over the integers, which in the case when $G$ is a knot group, is the Alexander polynomial of the knot. We prove, subject to certain restrictions on $w$, that if all roots of $A_w(X)$ are real and positive then $G$ is bi-orderable, and that if $G$ is bi-orderable then at least one root is real and positive. This sheds light on the bi-orderability of certain knot groups and on a question of Clay and Rolfsen. One of the results relies on an extension of work of G. Baumslag on adjunction of roots to groups, and this may have independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

I. M. Chiswell, A. M. W. Glass, John S. Wilson. 2014-11-02. Residual nilpotence and ordering in one-relator groups and knot groups. https://doi.org/10.1017/s0305004114000644

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR