English

Good Bounds in Certain Systems of True Complexity One

Number Theory 2018-12-31 v3 Combinatorics

Abstract

Let Φ=(ϕ1,,ϕ6)\Phi = (\phi_1,\dots,\phi_6) be a system of 66 linear forms in 33 variables, i.e. ϕi ⁣:Z3Z\phi_i \colon \mathbb{Z}^3 \to \mathbb{Z} for each ii. Suppose also that Φ\Phi has Cauchy--Schwarz complexity 22 and true complexity 11, in the sense defined by Gowers and Wolf; in fact this is true generically in this setting. Finally let G=FpnG = \mathbb{F}_p^n for any pp prime and n1n \ge 1. Then we show that multilinear averages by Φ\Phi are controlled by the U2U^2-norm, with a polynomial dependence; i.e. if f1,,f6 ⁣:GCf_1,\dots,f_6 \colon G \to \mathbb{C} are functions with fi1\|f_i\|_{\infty} \le 1 for each ii, then for each jj, 1j61 \le j \le 6: Ex1,x2,x3Gf1(φ1(x1,x2,x3))f6(ϕ6(x1,x2,x3))fjU21/C \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)) \right| \le \|f_j\|_{U^2}^{1/C} for some C>0C > 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 CC on Φ\Phi is necessary; that is, the constant CC can unavoidably become large as the coefficients of Φ\Phi grow.

Keywords

Cite

@article{arxiv.1705.06801,
  title  = {Good Bounds in Certain Systems of True Complexity One},
  author = {Freddie Manners},
  journal= {arXiv preprint arXiv:1705.06801},
  year   = {2018}
}

Comments

40 pages

R2 v1 2026-06-22T19:51:59.240Z