The asymmetric Cauchy–Schwarz complexity conjecture

From papers

Let Φ=(ϕ1,,ϕk)\Phi=(\phi_1,\dots,\phi_k) be a system of linear forms, with ϕi ⁣:FpdFp\phi_i\colon\mathbb{F}_p^d\to\mathbb{F}_p, and let i0[k]i_0\in[k]. Let s(Φ,i0)s(\Phi,i_0) be the asymmetric true complexity of the distinguished form. Asymmetric Cauchy–Schwarz conjecture. There should exist M0M\geq0 such that, for every n1n\geq1 and every collection of 11-bounded functions f1,,fk ⁣:FpnCf_1,\dots,f_k\colon\mathbb{F}_p^n\to\mathbb{C}, one has

ΛΦ(f1,,fk)fi0Us(Φ,i0)+12M.\left\lvert\Lambda_{\Phi}(f_1,\dots,f_k)\right\rvert\leq\|f_{i_0}\|_{U^{s(\Phi,i_0)+1}}^{2^{-M}}.

The claim also requires that this bound be provable using only repeated applications of Cauchy–Schwarz. The symmetric analogue is handled by the paper's main theorem, whereas natural systems satisfying the asymmetric statement remain open; the conjectured proof method is intended as a test case for strengthening Cauchy–Schwarz arguments.

Progress summary

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

Sources & referencesView supporting material

Primary source

Freddie Manners, “True complexity and iterated Cauchy–Schwarz”, arXiv:2109.05731 (2021).

Solutions 0

No solutions have been posted yet.