Good Bounds in Certain Systems of True Complexity One

Abstract

Let = (φ1,…,φ6) be a system of 6 linear forms in 3 variables, i.e. φi Z3 Z for each i. Suppose also that 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 = Fpn for any p prime and n 1. Then we show that multilinear averages by are controlled by the U2-norm, with a polynomial dependence; i.e. if f1,…,f6 G C are functions with \|fi\|∞ 1 for each i, then for each j, 1 j 6: \[ | Ex1,x2,x3 ∈ G f1(1(x1,x2,x3)) … f6(φ6(x1,x2,x3)) | \|fj\|U21/C \] for some C > 0 depending on . 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 is necessary; that is, the constant C can unavoidably become large as the coefficients of grow.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…