Search arXivSearch

arXiv · 2303.04843

Graphically discrete groups and rigidity

Abstract

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete. Notable examples include finitely generated nilpotent groups, most lattices in semisimple Lie groups, and irreducible non-geometric 3-manifold groups. We show graphs of groups with graphically discrete vertex groups frequently have strong rigidity properties. We prove free products of one-ended virtually torsion-free graphically discrete groups are action rigid within the class of virtually torsion-free groups. We also prove quasi-isometric rigidity for many hyperbolic graphs of groups whose vertex groups are closed hyperbolic manifold groups and whose edge groups are non-elementary quasi-convex subgroups. This includes the case of two hyperbolic 3-manifold groups amalgamated along a quasi-convex malnormal non-abelian free subgroup. We provide several additional examples of graphically discrete groups and illustrate this property is not a commensurability invariant.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Margolis, Sam Shepherd, Emily Stark, Daniel Woodhouse. 2023-03-08. Graphically discrete groups and rigidity. https://arxiv.org/abs/2303.04843

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