Multiple recurrence in quasirandom groups

DOI10.1007/s00039-014-0252-0zbMath1336.37007arXiv1211.6372MaRDI QIDQ2453444

Vitaly Bergelson, Terence C. Tao

Publication date: 6 June 2014

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

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

Mathematics Subject Classification ID

37A25: Ergodicity, mixing, rates of mixing

37A15: General groups of measure-preserving transformations and dynamical systems

Related Items

The largest $(k,\ell )$-sum-free subsets, On compactifications and product‐free sets, Følner sequences and sum-free sets, SCHUR’S COLOURING THEOREM FOR NONCOMMUTING PAIRS, Semicontinuity of structure for small sumsets in compact abelian groups, Quantitative Equidistribution for Certain Quadruples in Quasi-Random Groups, Triangles in Cartesian Squares of Quasirandom Groups, Corners Over Quasirandom Groups, Mixing and double recurrence in probability groups, Ultraproducts of quasirandom groups with small cosocles, Independent random partial matching with general types, Probabilistically-like nilpotent groups

Cites Work

• A measure-theoretic approach to the theory of dense hypergraphs
• Strong uniform expansion in \(\text{SL}(2,p)\).
• Algebra in the Stone-Čech compactification. Theory and applications
• A variant of the hypergraph removal lemma
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• WM groups and Ramsey theory
• Mixing actions of groups
• On the minimal degrees of projective representations of the finite Chevalley groups
• Finite sums from sequences within cells of a partition of N
• Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On the commuting probability in finite groups.
• MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS
• Two Combinatorial Problems in Group Theory
• Quasirandom Groups
• Conversion from Nonstandard to Standard Measure Spaces and Applications in Probability Theory
• A Roth theorem for amenable groups.
• FROM GRAPH LIMITS TO HIGHER ORDER FOURIER ANALYSIS
• Central sets and a non-commutative Roth theorem
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Applications of the regularity lemma for uniform hypergraphs
• On some problems of a statistical group-theory. IV
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item