The L2L^2 boundedness conjecture for nonamenable quasi-transitive graphs

Let GG be a connected, locally finite, nonamenable, quasi-transitive graph. Let TpT_p be the two-point matrix of Bernoulli bond percolation, with entries Tp(u,v)=Pp(uv)T_p(u,v)=\mathbb P_p(u\leftrightarrow v), and define

p22(G)=sup{p[0,1]:Tp22<}.p_{2\to 2}(G)=\sup\{p\in[0,1]:\|T_p\|_{2\to 2}<\infty\}.

L2L^2 boundedness conjecture.

pc(G)<p22(G).p_c(G)<p_{2\to 2}(G).

This strong quantitative conjecture implies both the separation of the critical and uniqueness thresholds and the triangle condition. It is known in a variety of special cases but remains open in general.

Sources & referencesView supporting material

Primary source

Tom Hutchcroft, “The L^2 boundedness condition in nonamenable percolation”, arXiv:1904.05804 (2020).

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.