SearcharxivSearch

arXiv · 2504.18354

Homogeneity in Coxeter groups and split crystallographic groups

Abstract

We prove that affine Coxeter groups, even hyperbolic Coxeter groups and one-ended hyperbolic Coxeter groups are homogeneous in the sense of model theory. More generally, we prove that many (Gromov) hyperbolic groups generated by torsion elements are homogeneous. In contrast, we construct split crystallographic groups that are not homogeneous, and hyperbolic (in fact, virtually free) Coxeter groups that are not homogeneous (or, to be more precise, not $\mathrm{EAE}$-homogeneous). We also prove that, on the other hand, irreducible split crystallographic groups and torsion-generated hyperbolic groups are almost homogeneous. We also prove that finitely generated abelian-by-finite groups are homogeneous if and only if they are profinitely homogeneous, i.e., any tuple of words from the group is profinitely rigid. We use this to deduce that affine Coxeter groups are profinitely homogeneous, a result of independent interest in the profinite context.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon André, Gianluca Paolini. 2025-04-25. Homogeneity in Coxeter groups and split crystallographic groups. https://arxiv.org/abs/2504.18354

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