SearcharxivSearch

arXiv · 2304.12509

Small doubling for discrete subsets of non-commutative groups and a theorem of Lagarias

Abstract

Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and have finite co-volume. A theorem of Lagarias provides a criterion for discrete subsets of Euclidean spaces to be approximate lattices. It asserts that if a subset $X$ of $\mathbb{R}^n$ is relatively dense and $X - X$ is uniformly discrete, then $X$ is an approximate lattice. We prove two generalisation of Lagarias' theorem: when the ambient group is amenable and when it is a higher-rank simple algebraic group over a characteristic $0$ local field. This is a natural counterpart to the recent structure results for approximate lattices in non-commutative locally compact groups. We also provide a reformulation in dynamical terms pertaining to return times of cross-sections. Our method relies on counting arguments involving the so-called periodization maps, ergodic theorems and a method of Tao regarding small doubling for finite subsets. In the case of simple algebraic groups over local fields, we moreover make use of deep superrigidity results due to Margulis and to Zimmer.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Machado. 2023-04-25. Small doubling for discrete subsets of non-commutative groups and a theorem of Lagarias. https://arxiv.org/abs/2304.12509

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