2012
DOI: 10.1007/s10240-012-0043-9
|View full text |Cite
|
Sign up to set email alerts
|

The structure of approximate groups

Abstract: Let K 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A · A is covered by K left translates of A.The main result of this paper is a qualitative description of approximate groups as being essentially finite-by-nilpotent, answering a conjecture of H. Helfgott and E. Lindenstrauss. This may be viewed as a generalisation of the Freiman-Ruzsa theorem on sets of small doubling in the integers to arbitrary groups.We begin by establi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

11
268
0
2

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 168 publications
(281 citation statements)
references
References 49 publications
11
268
0
2
Order By: Relevance
“…The proof relies on a recent quantitative version of Gromov's theorem on groups with polynomial growth obtained by Breuillard, Green and Tao [BGT12] and a scaling limit theorem for nilpotent groups by Pansu. A quantitative version of this theorem can be useful in establishing the resistance conjecture from [BK05] and the polynomial case of the conjectures in [ABS04]. In [BGT12] a strong isoperimetric inequality for finite vertex transitive is established.…”
Section: Scaling Limitsmentioning
confidence: 99%
“…The proof relies on a recent quantitative version of Gromov's theorem on groups with polynomial growth obtained by Breuillard, Green and Tao [BGT12] and a scaling limit theorem for nilpotent groups by Pansu. A quantitative version of this theorem can be useful in establishing the resistance conjecture from [BK05] and the polynomial case of the conjectures in [ABS04]. In [BGT12] a strong isoperimetric inequality for finite vertex transitive is established.…”
Section: Scaling Limitsmentioning
confidence: 99%
“…In [5], we established a structure theorem for sets of small doubling and for approximate subgroups of arbitrary groups. Approximate subgroups are symmetric finite subsets A of an ambient group whose product set AA can be covered by a bounded number of translates of the set.…”
Section: Introductionmentioning
confidence: 99%
“…One of the main theorems proved in [5] asserts, roughly speaking, that approximate subgroups can be covered by a bounded number of cosets of a certain finite-by-nilpotent subgroup with bounded complexity. The bounds on the number of cosets and on the complexity (rank and step) of the nilpotent subgroup depend only on the doubling parameter K.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations