SearcharxivSearch

arXiv · 2310.10256

The definitions of approximate lattices

Abstract

Approximate lattices of locally compact groups were first studied in a seminal monograph of Yves Meyer and were subsequently used in the theory of aperiodic order to model objects such as Pisot numbers, quasi-cristals or aperiodic tilings. Meyer studied approximate lattices of Euclidean spaces - now dubbed Meyer sets. A fascinating feature of this theory is the wealth of natural and equivalent definitions of Meyer sets that are available. The study of approximate lattices in non-commutative groups has recently attracted more attention. They are meant as generalisation of lattices of locally compact groups (i.e. discrete subgroup of finite co-volume) and, as such, are roughly defined as approximate subgroups of locally compact groups that are both discrete and have finite co-volume. In this generalized framework, the correct notion of `finite co-volume' is however up for interpretation. A number of definitions recently arose following work of Bj\"{o}rklund and Hartnick, Hrushovski, and the author. In stark contrast with the Euclidean framework, little is known of the relations between these notions. Our main objective in this paper is to address this issue. We establish clear relations between these definitions and show that, in fact, these definitions are not all equivalent. We prove nevertheless that all the notions mentioned are related to one another and simply represent varying degrees of generality. Among the original results we prove here, we extend a cornerstone theorem of Meyer and show that all strong approximate lattices are laminar; we build measures with weak invariance properties on the invariant hull of approximate lattices; we use quasi-models to show that any BH-approximate lattice is contained in an approximate lattice; we prove that even laminar approximate lattices can be arbitrarily far from strong approximate lattices and model sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Machado. 2023-10-16. The definitions of approximate lattices. https://arxiv.org/abs/2310.10256

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