SearcharxivSearch

arXiv · 2411.15337

Graphical models for topological groups: A case study on countable Stone spaces

Abstract

By analogy with the Cayley graph of a group with respect to a finite generating set or the Cayley--Abels graph of a totally disconnected, locally compact group, we detail countable connected graphs associated to Polish groups that we term Cayley--Abels--Rosendal graphs. A group admitting a Cayley--Abels--Rosendal graph acts on it continuously, coarsely metrically properly and cocompactly by isometries of the path metric. By an expansion of the Milnor--Schwarz lemma, it follows that the group is generated by a coarsely bounded set and the group equipped with a word metric with respect to a coarsely bounded generating set and the graph are quasi-isometric. In other words, groups admitting Cayley--Abels--Rosendal graphs are topological analogues of finitely generated groups. Our goal is to introduce this topological perspective on the work of Rosendal to a geometric group theorist. We apply these concepts to homeomorphism groups of countable Stone spaces. We completely characterize when these homeomorphism groups are coarsely bounded, when they are locally bounded (all of them are), and when they admit a Cayley--Abels--Rosendal graph, and if so produce a coarsely bounded generating set.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Beth Branman, George Domat, Hannah Hoganson, Robert Alonzo Lyman. 2024-11-22. Graphical models for topological groups: A case study on countable Stone spaces. https://doi.org/10.1112/blms.70097

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