Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms

DOI10.1007/s00039-011-0141-8zbMath1291.11026arXiv1011.4600MaRDI QIDQ657865

Shachar Lovett, Hamed Hatami

Publication date: 10 January 2012

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

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

zbMATH Keywords

arithmetic progressions; higher-order Fourier analysis; Gowers uniformity norm; analytic averages involving the indicator function; density of small linear structures

Mathematics Subject Classification ID

11T24: Other character sums and Gauss sums

11B30: Arithmetic combinatorics; higher degree uniformity

Related Items

Good Bounds in Certain Systems of True Complexity One, Bootstrapping partition regularity of linear systems, General systems of linear forms: equidistribution and true complexity, Properties of high rank subvarieties of affine spaces

Cites Work

• Unnamed Item
• 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\)
• The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
• Linear equations in primes
• An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
• The distribution of polynomials over finite fields, with applications to the Gowers norms
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• On sets of integers containing k elements in arithmetic progression
• Correlation testing for affine invariant properties on F _p ⁿ in the high error regime
• On Certain Sets of Integers
• The true complexity of a system of linear equations
• A new proof of Szemerédi's theorem