Mixing for progressions in nonabelian groups.

DOI10.1017/FMS.2013.2MaRDI QIDQ2849814zbMATH OpenOpenAlexFDO

Authors Terence Tao

Publication date 19 September 2013

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1212.2586

zbMATH Keywords

finite Fourier transformfinite nonabelian groupsmixing propertiesnumbers of progressions

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Linear algebraic groups over finite fields (20G40)

Abstract: We study the mixing properties of progressions $(x,xg,x{g}^2)$, $(x,xg,x{g}^2,x{g}^3)$ of length three and four in a model class of finite non-abelian groups, namely the special linear groups $S{L}_d(F)$ over a finite field $F$, with $d$ bounded. For length three progressions $(x,xg,x{g}^2)$, we establish a strong mixing property (with error term that decays polynomially in the order $|F|$ of $F$), which among other things counts the number of such progressions in any given dense subset $A$ of $S{L}_d(F)$, answering a question of Gowers for this class of groups. For length four progressions $(x,xg,x{g}^2,x{g}^3)$, we establish a partial result in the $d=2$ case if the shift $g$ is restricted to be diagonalisable over the field, although in this case we do not recover polynomial bounds in the error term. Our methods include the use of the Cauchy-Schwarz inequality, the abelian Fourier transform, the Lang-Weil bound for the number of points in an algebraic variety over a finite field, some algebraic geometry, and (in the case of length four progressions) the multidimensional Szemer'edi theorem.

Recommendations

• Mixing for three-term progressions in finite simple groups
• Product mixing in the alternating group
• Words and mixing times in finite simple groups.
• Multiple recurrence in quasirandom groups
• Mixing, communication complexity and conjectures of Gowers and Viola

Cites work

• A new proof of Szemerédi's theorem
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A new proof of the density Hales-Jewett theorem
• A variant of the hypergraph removal lemma
• An ergodic Szemerédi theorem for commuting transformations
• Applications of the regularity lemma for uniform hypergraphs
• Approximate subgroups of linear groups.
• Expander graphs in pure and applied mathematics
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
• Hypergraph regularity and the multidimensional Szemerédi theorem
• New bounds on cap sets
• Number of Points of Varieties in Finite Fields
• On Roth's theorem on progressions
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On the minimal degrees of projective representations of the finite Chevalley groups
• On triples in arithmetic progression
• Quasirandom Groups
• Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).

Cited in

(10)

• On the chromatic number of structured Cayley graphs
• Multiple recurrence in quasirandom groups
• Multiple mixing and local rank group actions
• Mixing for three-term progressions in finite simple groups
• Counting configuration-free sets in groups
• Counting configuration-free sets in groups
• On approximability of satisfiable k-CSPs. II
• Complete type amalgamation for nonstandard finite groups
• New-type quasirandom groups and applications
• On approximability of satisfiable k-CSPs: II

This page was built for publication: Mixing for progressions in nonabelian groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849814)