Good bounds in certain systems of true complexity one

DOI10.19086/DA.6814MaRDI QIDQ4645046zbMATH OpenOpenAlexFDO

Authors Frederick R. W. M. Manners

Publication date 9 January 2019

Published in discrete Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: Let $Phi=(ph{i}_1,dots,ph{i}_6)$ be a system of $6$ linear forms in $3$ variables, i.e. $ph{i}_{i}colonmathbb{Z}^{3}omathbbZ$ for each $i$. Suppose also that $Phi$ has Cauchy--Schwarz complexity $2$ and true complexity $1$, in the sense defined by Gowers and Wolf; in fact this is true generically in this setting. Finally let $G=mathbb{F}_p^n$ for any $p$ prime and $nge1$. Then we show that multilinear averages by $Phi$ are controlled by the $U^2$-norm, with a polynomial dependence; i.e. if $f_1,dots,f_{6}colonGomathbbC$ are functions with $|f_i{|}_{infty}le1$ for each $i$, then for each $j$, $1lejle6$: [ left| mathbb{E}_{x_1,x_2,x_3 in G} f_1(varphi_1(x_1,x_2,x_3)) dots f_6(phi_6(x_1,x_2,x_3)) ight| le |f_j|_{U^2}^{1/C} ] for some $C>0$ depending on $Phi$. This recovers and strengthens a result of Gowers and Wolf in these cases. Moreover, the proof uses only multiple applications of the Cauchy--Schwarz inequality, avoiding appeals to the inverse theory of the Gowers norms. We also show that some dependence of $C$ on $Phi$ is necessary; that is, the constant $C$ can unavoidably become large as the coefficients of $Phi$ grow.

Recommendations

• A refinement of Cauchy-Schwarz complexity
• The true complexity of a system of linear equations
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• Linear forms and quadratic uniformity for functions on F^n_p
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms

Cites work

• A new proof of Szemerédi's theorem
• An arithmetic regularity lemma, an associated counting lemma, and applications
• General systems of linear forms: equidistribution and true complexity
• Higher order Fourier analysis
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
• scientific article; zbMATH DE number 5652361 (Why is no real title available?)
• Linear equations in primes
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• Linear forms and quadratic uniformity for functions on F^n_p
• Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
• On the Bogolyubov-Ruzsa lemma
• The true complexity of a system of linear equations

Cited in

(9)

• Induced arithmetic removal: complexity 1 patterns over finite fields
• A refinement of Cauchy-Schwarz complexity
• Linear forms and quadratic uniformity for functions on F^n_p
• Bootstrapping partition regularity of linear systems
• True complexity of polynomial progressions in finite fields
• The true complexity of a system of linear equations
• On several notions of complexity of polynomial progressions
• On higher-order Fourier analysis in characteristic p
• Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms

This page was built for publication: Good bounds in certain systems of true complexity one

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