Gowers–Wolf conjecture on the true complexity of linear systems

About 19 years old · traced to

Let GG be a finite Abelian group, and let L=(L1,…,Lm)\mathcal{L}=(L_1,\dots,L_m) be a system of distinct linear forms in dd variables. The true complexity of L\mathcal{L} is the smallest kk such that, for every ϵ>0\epsilon>0, there exists δ>0\delta>0 with the property that every function f:G→Cf:G\to\mathbb{C} satisfying ∥f∥∞≤1\|f\|_\infty\leq 1 and ∥f∥Uk+1≤δ\|f\|_{U^{k+1}}\leq\delta also satisfies

∣Ex1,…,xd∈G∏i=1mf(Li(x1,…,xd))∣≤ϵ.\left|\mathbb{E}_{x_1,\dots,x_d\in G}\prod_{i=1}^m f\bigl(L_i(x_1,\dots,x_d)\bigr)\right|\leq\epsilon.

Gowers–Wolf conjecture. The true complexity of L\mathcal{L} is equal to the smallest kk such that the functions L1k+1,…,Lmk+1L_1^{k+1},\dots,L_m^{k+1} are linearly independent. This conjecture identifies the precise degree of uniformity controlling averages associated with a system of linear forms. The paper presents the linear independence condition as the conjectural converse to the known obstruction from linearly dependent powers, while the general assertion is not resolved in the supplied source.

References

Primary source

W. T. Gowers and J. Wolf, “The true complexity of a system of linear equations”, arXiv:0711.0185 (2007).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.