SearcharxivSearch

arXiv · 1612.09246

Approximate lattices

Abstract

In this article we introduce and study uniform and non-uniform approximate lattices in locally compact second countable (lcsc) groups. These are approximate subgroups (in the sense of Tao) which simultaneously generalize lattices in lcsc group and mathematical quasi-crystals (a.k.a. Meyer sets) in lcsc abelian groups. We show that envelopes of strong approximate lattices are unimodular, and that approximate lattices in nilpotent groups are uniform. We also establish several results relating properties of approximate lattices and their envelopes. For example, we prove a version of the Milnor-Schwarz lemma for uniform approximate lattices in compactly-generated lcsc groups, which we then use to relate metric amenability of uniform approximate lattices to amenability of the envelope. Finally we extend a theorem of Kleiner and Leeb to show that the isometry groups of higher rank symmetric spaces of non-compact type are QI rigid with respect to finitely-generated approximate groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Björklund, Tobias Hartnick. 2016-12-29. Approximate lattices. https://doi.org/10.1215/00127094-2018-0028

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