SearcharxivSearch

arXiv · 2507.22230

A guide to constructing free transitive actions on median spaces

Abstract

We construct large families of groups admitting free transitive actions on median spaces. In particular, we construct groups which act freely and transitively on the complete universal real tree with continuum valence such that any subgroup of the additive reals is realised as the stabiliser of an axis. We prove a more precise version of this, which implies that there are $2^{2^{\aleph_0}}$ pairwise non-isomorphic groups which admit a free transitive action on this real tree. We also construct free transitive actions on products of complete real trees such that any subgroup of $\mathbb{R}^n$ is realised as the stabiliser of a maximal flat, and an irreducible action on the product of two complete real trees. To construct each of these groups, we introduce the notion of an \textit{ore}: a set equipped with the structure of a meet semilattice and a cancellative monoid with involution, which verifies some additional axioms. We show that one can \textit{extract} a group from an ore and equip this group with a left-invariant median structure.

Explore related subjects

Keep this discovery

BibTeXRIS

Pénélope Azuelos. 2025-07-29. A guide to constructing free transitive actions on median spaces. https://arxiv.org/abs/2507.22230

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