2016
DOI: 10.1016/j.aim.2015.11.025
|View full text |Cite
|
Sign up to set email alerts
|

Nilprogressions and groups with moderate growth

Abstract: We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a number of applications to the geometry and spectrum of finite Cayley graphs. For example, we show that a finite group has moderate growth in the sense of Diaconis and Saloff-Coste if and only if its diameter is larger than a fixed power of the cardinality of the group. We cal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
56
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 46 publications
(60 citation statements)
references
References 44 publications
4
56
0
Order By: Relevance
“…Proof. We essentially reproduce the proof of the closely related [4,Lemma 2.7]. If S n+1 xH = S n xH for a given n then it follows by induction that S r xH = S n xH for every r ≥ n, and hence that G = S n xH.…”
Section: Uniform Measurement Of Index By Almost-invariant Measuresmentioning
confidence: 94%
“…Proof. We essentially reproduce the proof of the closely related [4,Lemma 2.7]. If S n+1 xH = S n xH for a given n then it follows by induction that S r xH = S n xH for every r ≥ n, and hence that G = S n xH.…”
Section: Uniform Measurement Of Index By Almost-invariant Measuresmentioning
confidence: 94%
“…For all non-abelian finite simple groups, Breuillard and Tointon [8] also obtained a diameter bound of max(|G| , C ) for arbitrary > 0 and a constant C depending only on . The diameter bounds in all these previous results depend poorly on the rank of the group.…”
Section: History and Backgroundmentioning
confidence: 99%
“…The basic idea behind our proof of Theorem 1.11 is to control the growth of S m in terms of the growth of a certain nilprogression of bounded rank and step. In its simplest form, the tool that allows us to do this is the following result, which essentially appeared in [36] and was implicit in [13]. Remark.…”
Section: Sets Of Polynomial Growth In Terms Of Progressionsmentioning
confidence: 99%