{"id":"hexagon/2611.00251","pdf":"https://hexagonmath.org/pdf/2611.00251v1","url":"https://hexagonmath.org/abs/2611.00251v1","tags":["math.CO","math.GR","math-ph","msc:60K35","msc:82B43","msc:05C63","msc:20F65","Benjamini-Schramm conjecture","nonamenable graphs","nonuniqueness"],"score":0,"title":"Nonuniqueness of site percolation on nonamenable quasi-transitive graphs","domain":"math.PR","origin":"ai-generated","source":"hexagon","authors":["Yan Ru Pei"],"reviews":0,"subject":"math.PR","summary":"Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has $p_c<p_u$. We prove this in Hutchcroft's operator form: for Bernoulli site percolation on every connected, locally finite, nonamenable quasi-transitive graph, the critical two-point operator is bounded on $\\ell^2$, $p_c<p_{2\\to2}\\le p_u$, and in the standard monotone coupling infinitely many infinite clusters coexist at every parameter of a nondegenerate interval. Since bond percolation is site percolation on the line graph, this contains OpenAI's recent bond theorem. For…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}