Higher-order Fourier analysis of F_p^n and the complexity of systems of linear forms
From MaRDI portal
(Redirected from Publication:657865)
Higher-order Fourier analysis of \(\mathbb F p^n\) and the complexity of systems of linear forms
Higher-order Fourier analysis of \(\mathbb F p^n\) and the complexity of systems of linear forms
Abstract: Consider a subset of and a decomposition of its indicator function as the sum of two bounded functions . For every family of linear forms, we find the smallest degree of uniformity such that assuming that is sufficiently small, it is possible to discard and replace with in the average over this family of linear forms, affecting it only negligibly. Previously, Gowers and Wolf solved this problem for the case where 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 . Geom. Funct. Anal., 21(1):36--69, 2011] regarding the analytic averages that involve more than one subset of .] regarding the analytic averages that involve more than one subset of .
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
Cites work
- scientific article; zbMATH DE number 5219603 (Why is no real title available?)
- A new proof of Szemerédi's theorem
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- Correlation testing for affine invariant properties on F p n in the high error regime
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Linear equations in primes
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- On Certain Sets of Integers
- On sets of integers containing k elements in arithmetic progression
- 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
- The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
- The true complexity of a system of linear equations
Cited in
(10)- General systems of linear forms: equidistribution and true complexity
- Higher-order Fourier analysis and applications
- Properties of high rank subvarieties of affine spaces
- Good bounds in certain systems of true complexity one
- On higher-order Fourier analysis in characteristic p
- The true complexity of a system of linear equations
- Bootstrapping partition regularity of linear systems
- Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)
- Convergence results for systems of linear forms on cyclic groups and periodic nilsequences
- Four variants of the Fourier-analytic transference principle
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)