SearcharxivSearch

arXiv · 1612.05152

Properness of nilprogressions and the persistence of polynomial growth of given degree

Abstract

We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of the Freiman-Bilu result that a generalised arithmetic progression can be efficiently contained in a proper generalised arithmetic progression, and indeed an important ingredient in the proof is a Lie-algebra version of the geometry-of-numbers argument at the centre of that result. We also present some applications. We verify a conjecture of Benjamini that if $S$ is a symmetric generating set for a group such that $1\in S$ and $|S^n|\le Mn^D$ at some sufficiently large scale $n$ then $S$ exhibits polynomial growth of the same degree $D$ at all subsequent scales, in the sense that $|S^r|\ll_{M,D}r^D$ for every $r\ge n$. Our methods also provide an important ingredient in a forthcoming companion paper in which we reprove and sharpen a result about scaling limits of vertex-transitive graphs of polynomial growth due to Benjamini, Finucane and the first author. We also note that our arguments imply that every approximate group has a large subset with a large quotient that is Freiman isomorphic to a subset of a torsion-free nilpotent group of bounded rank and step.

Explore related subjects

Keep this discovery

BibTeXRIS

Romain Tessera, Matthew Tointon. 2016-12-15. Properness of nilprogressions and the persistence of polynomial growth of given degree. https://arxiv.org/abs/1612.05152

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