An arithmetic regularity lemma, associated counting lemma, and applications

From MaRDI portal
Publication:3078206


zbMath1222.11015arXiv1002.2028MaRDI QIDQ3078206

Ben Green, Terence C. Tao

Publication date: 18 February 2011

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


11B25: Arithmetic progressions

11B30: Arithmetic combinatorics; higher degree uniformity


Related Items

NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, Notes on compact nilspaces, Good Bounds in Certain Systems of True Complexity One, Bootstrapping partition regularity of linear systems, The level of distribution of the Thue–Morse sequence, Automatic Sequences and Generalised Polynomials, Popular progression differences in vector spaces II, Monochromatic Solutions to, An inverse theorem for the Gowers \(U^{s+1}[N\)-norm], Linear quasi-randomness of subsets of abelian groups and hypergraphs, General systems of linear forms: equidistribution and true complexity, Cancellation for the multilinear Hilbert transform, Arithmetic progressions with a pseudorandom step, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, Large values of the Gowers-Host-Kra seminorms, The inverse conjecture for the Gowers norm over finite fields in low characteristic, Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\), Sets of integers with no large sum-free subset, A continuous model for systems of complexity 2 on simple abelian groups, Counting sets with small sumset and applications, A proof of a sumset conjecture of Erdős, A structure theorem for multiplicative functions over the Gaussian integers and applications, Regularity lemmas for clustering graphs, Regular partitions of gentle graphs, Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\), On the quantitative distribution of polynomial nilsequences -- erratum, Monochromatic sums and products, Higher order Fourier analysis of multiplicative functions and applications, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Embedding Graphs into Larger Graphs: Results, Methods, and Problems