Higher-order Fourier analysis of F_p^n and the complexity of systems of linear forms

DOI10.1007/S00039-011-0141-8zbMATH Open1291.11026arXiv1011.4600OpenAlexW2094651847MaRDI QIDQ657865FDOQ657865

Authors: Hamed Hatami, Shachar Lovett 

Publication date: 10 January 2012

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

Abstract: Consider a subset $A$ of $mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming that $|f_2{|}_{U^k}$ is sufficiently small, it is possible to discard $f_2$ and replace $1_A$ with $f_1$ in the average over this family of linear forms, affecting it only negligibly. Previously, Gowers and Wolf solved this problem for the case where $f_1$ is a constant function. Furthermore, our main result solves Problem 7.6 in [W. T. Gowers and J. Wolf. Linear forms and higher-degree uniformity for functions on $mathbb{F}_p^n$. Geom. Funct. Anal., 21(1):36--69, 2011] regarding the analytic averages that involve more than one subset of $mathbb{F}_p^n$.] regarding the analytic averages that involve more than one subset of $mathbb{F}_p^n$.

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

Recommendations

• General systems of linear forms: equidistribution and true complexity
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• The true complexity of a system of linear equations
• Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)
• Good bounds in certain systems of true complexity one

zbMATH Keywords

arithmetic progressionsGowers uniformity normanalytic averages involving the indicator functiondensity of small linear structureshigher-order Fourier analysis

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Other character sums and Gauss sums (11T24)

Cites Work

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

Cited In (9)

• General systems of linear forms: equidistribution and true complexity
• Bootstrapping partition regularity of linear systems
• Higher-order Fourier analysis and applications
• The true complexity of a system of linear equations
• Good bounds in certain systems of true complexity one
• Properties of high rank subvarieties of affine spaces
• Convergence results for systems of linear forms on cyclic groups and periodic nilsequences
• Four variants of the Fourier-analytic transference principle
• Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)

This page was built for publication: Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms

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