Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0909.0273

Free lattice ordered groups and the topology on the space of left orderings of a group

Adam Clay
View original source ↗Read source document ↗Export metadata ↓

Abstract

For any left orderable group G, we recall from work of McCleary that isolated points in the space of left orderings correspond to basic elements in the free lattice ordered group over G. We then establish a new connection between the kernels of certain maps in the free lattice ordered group over G, and the topology on the space of left orderings of G. This connection yields a simple proof that no left orderable group has countably infinitely many left orderings. When we take G to be the free group of rank n, this connection sheds new light on the space of left orderings of the free group: by applying a result of Kopytov, we show that there exists a left ordering of the free group whose orbit is dense in the space of left orderings. From this, we obtain a new proof that the space of left orderings of a free group contains no isolated points.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Adam Clay. 2009-09-01. Free lattice ordered groups and the topology on the space of left orderings of a group. https://arxiv.org/abs/0909.0273

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗