Product decompositions of quasirandom groups and a Jordan type theorem

53Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If k is the minimal degree of a representation of the finite group G, then for every subset B of G with |B| > \G|/k1/3 we have B3 = G. We use this to obtain improved versions of recent deep theorems of Helfgott and of Shalev concerning product decompositions of finite simple groups, with much simpler proofs. On the other hand, we prove a version of Jordan's theorem which implies that if k ≥ 2, then G has a proper subgroup of index at most c0k2 for some constant c 0, hence a product-free subset of size at least |G|/(ck). This answers a question of Gowers. © European Mathematical Society 2011.

References Powered by Scopus

On the minimal degrees of projective representations of the finite Chevalley groups

301Citations
N/AReaders
Get full text

Quasirandom groups

161Citations
N/AReaders
Get full text

Growth and generation in SL<inf>2</inf>(ℤ/pℤ)

153Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Approximate Subgroups of Linear Groups

114Citations
N/AReaders
Get full text

The Waring problem for finite simple groups

72Citations
N/AReaders
Get full text

Expansion in perfect groups

54Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Nikolov, N., & Pyber, L. (2011). Product decompositions of quasirandom groups and a Jordan type theorem. Journal of the European Mathematical Society, 13(4), 1063–1077. https://doi.org/10.4171/JEMS/275

Readers' Seniority

Tooltip

Professor / Associate Prof. 2

40%

Researcher 2

40%

PhD / Post grad / Masters / Doc 1

20%

Readers' Discipline

Tooltip

Mathematics 5

83%

Computer Science 1

17%

Article Metrics

Tooltip
Mentions
References: 2

Save time finding and organizing research with Mendeley

Sign up for free