MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS
From MaRDI portal
Publication:2849814
DOI10.1017/fms.2013.2zbMath1328.20065arXiv1212.2586OpenAlexW2964261566MaRDI QIDQ2849814
Publication date: 19 September 2013
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2586
Linear algebraic groups over finite fields (20G40) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
On the chromatic number of structured Cayley graphs, Mixing for three-term progressions in finite simple groups, Counting configuration-free sets in groups, Multiple recurrence in quasirandom groups, Counting configuration-free sets in groups
Cites Work
- A new proof of the density Hales-Jewett theorem
- On Roth's theorem on progressions
- Approximate subgroups of linear groups.
- A variant of the hypergraph removal lemma
- An ergodic Szemerédi theorem for commuting transformations
- On the minimal degrees of projective representations of the finite Chevalley groups
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- On triples in arithmetic progression
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
- Hypergraph regularity and the multidimensional Szemerédi theorem
- New bounds on cap sets
- Expander graphs in pure and applied mathematics
- Quasirandom Groups
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Applications of the regularity lemma for uniform hypergraphs
- Number of Points of Varieties in Finite Fields
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- A new proof of Szemerédi's theorem
