SearcharxivSearch

arXiv · 2206.10712

Generic length functions on countable groups

Abstract

Let $L(G)$ denote the space of integer-valued length functions on a countable group $G$ endowed with the topology of pointwise convergence. Assuming that $G$ does not satisfy any non-trivial mixed identity, we prove that a generic (in the Baire category sense) length function on $G$ is a word length and the associated Cayley graph is isomorphic to a certain universal graph $U$ independent of $G$. On the other hand, we show that every comeager subset of $L(G)$ contains $2^{\aleph_0}$ asymptotically incomparable length functions. A combination of these results yields $2^{\aleph_0}$ pairwise non-equivalent regular representations $G\to Aut(U)$. We also prove that generic length functions are virtually indistinguishable from the model-theoretic point of view. Topological transitivity of the action of $G$ on $L(G)$ by conjugation plays a crucial role in the proof of the latter result.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Jarnevic, D. Osin, K. Oyakawa. 2022-06-21. Generic length functions on countable groups. https://arxiv.org/abs/2206.10712

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