Trace bounds for high powers in the singular value method
Derive good upper bounds for tr((Mw Mw)^r) when r ≥ 4, where Mw is the |W| × N matrix with entries Mw_{t,n} = w(n/N) e^{it log n} for t ∈ W and n ~ N, with W a Te-separated subset of an interval of length T and w a fixed smooth bump supported on [1, 2], to enable improved control of the largest singular value s1(Mw) beyond the current r = 3 approach.
References
If one could establish such a sharp bound on tr((Mw Mw)") for large r, this would give Conjecture 1.5. Unfortunately we do not know how to obtain good bounds when r ≥ 4, so we work with r = 3.
In a more classical language, these computations correspond to the fact that with current understanding of the large values of Dirichlet polynomials, we cannot rule out the scenario that, for bounded coefficients a_j(n),
\left|\sum_{n \sim X{\beta_j}} \frac{a_j(n)}{n{1/2+it}}\right| \geq X{\beta_j(1/2-3/10)}
for \gg X{3/10} one-separated points t \in [-X{\tau}, X{\tau}].
In order to obtain the exponent 3/5-\varepsilon in Theorem \ref{thm:intro-uniformity}, we would need to essentially have, for T = X{O(1)}, the bound
\int_{X\varepsilon}{X{\tau+\varepsilon}}\left|\sum_{n \sim X{1/4}} \frac{1}{n{1/2+it+iT}}\right|4 dt \ll \frac{X{1/2}}{\logA X},
and it is the above-mentioned scenario which prevents us from obtaining this—the coefficients a_j(n)=n{-iT} prevent us from using type I information once T is a largish power of X.