Linear forms and quadratic uniformity for functions on F^n_p

DOI10.1112/S0025579311001264MaRDI QIDQ3087002zbMATH OpenFDO

Authors Julia Wolf, W. Timothy Gowers

Publication date 1 August 2011

Published in Mathematika (Search for Journal in Brave)

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

zbMATH Keywords

Hahn-Banach theoremlinear formsquadratic uniformity

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: We give improved bounds for our theorem in [GW09], which shows that a system of linear forms on $mathbb{F}_p^n$ with squares that are linearly independent has the expected number of solutions in any linearly uniform subset of $mathbb{F}_p^n$. While in [GW09] the dependence between the uniformity of the set and the resulting error in the average over the linear system was of tower type, we now obtain a doubly exponential relation between the two parameters. Instead of the structure theorem for bounded functions due to Green and Tao [GrT08], we use the Hahn-Banach theorem to decompose the function into a quadratically structured plus a quadratically uniform part. This new decomposition makes more efficient use of the $U^3$ inverse theorem [GrT08].

Recommendations

• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
• Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
• Good bounds in certain systems of true complexity one
• The true complexity of a system of linear equations

Cites work

• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• An equivalence between inverse sumset theorems and inverse conjectures for the \(U^{3}\) norm
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• Linear equations in primes
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• On triples in arithmetic progression
• The primes contain arbitrarily long arithmetic progressions
• The true complexity of a system of linear equations

Cited in

(16)

• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• General systems of linear forms: equidistribution and true complexity
• Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
• On several notions of complexity of polynomial progressions
• Finite field models in arithmetic combinatorics -- ten years on
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• Good bounds in certain systems of true complexity one
• Induced arithmetic removal: complexity 1 patterns over finite fields
• Advice lower bounds for the dense model theorem
• A refinement of Cauchy-Schwarz complexity
• Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
• True complexity of polynomial progressions in finite fields
• Generalizations of Fourier analysis, and how to apply them
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
• Further bounds in the polynomial Szemerédi theorem over finite fields
• Monochromatic sums and products

This page was built for publication: Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)

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