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




Abstract: Consider a subset A of mathbbFpn and a decomposition of its indicator function as the sum of two bounded functions 1A=f1+f2. For every family of linear forms, we find the smallest degree of uniformity k such that assuming that |f2|Uk is sufficiently small, it is possible to discard f2 and replace 1A with f1 in the average over this family of linear forms, affecting it only negligibly. Previously, Gowers and Wolf solved this problem for the case where f1 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 mathbbFpn. Geom. Funct. Anal., 21(1):36--69, 2011] regarding the analytic averages that involve more than one subset of mathbbFpn.] regarding the analytic averages that involve more than one subset of mathbbFpn.









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)