The anti-concentration norm-sum conjecture for inhomogeneous random walks

About 11 years old · traced to

Let GG be the group and let μi\mu_i be the measures appearing in Theorem 3.1, with AiA_i denoting their supports and idG∈Aiid_G\in A_i. Assume that

ρ(μ1,…,μn)≥n−O(1).\rho(\mu_1,\dots,\mu_n)\ge n^{-O(1)}.

Anti-concentration norm-sum conjecture. There exist consecutive indices i0,…,i0+n1−εi_0,\dots,i_0+n^{1-\varepsilon} such that

∑i0≤i≤i0+n1−ε∑ai∈Ai∥ai∥HP,X2≪1.\sum_{i_0\leq i\leq i_0+n^{1-\varepsilon}}\sum_{a_i\in A_i}\|a_i\|_{HP,X}^2\ll 1.

The conjecture proposes that the waste from using the triangle inequality can be avoided over a block of consecutive steps, yielding a uniformly bounded total squared HPHP-norm. The supplied text gives no resolution status or further evidence, so the conjecture is recorded as open.

References

Primary source

Hoi H. Nguyen, “Anti-concentration of inhomogeneous random walks”, arXiv:1508.01393 (2017).

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.