clopen.solutions

Nonuniqueness of percolation on nonamenable quasi-transitive graphs

Recorded by the registry's curators from GitHub; the authors did not submit it here.

OpenAI

We prove the bond-percolation nonuniqueness conjecture of Benjamini and Schramm: every infinite connected, locally finite, nonamenable quasi-transitive graph has a nonempty interval of parameters for which Bernoulli bond percolation almost surely has infinitely many infinite clusters. We also prove Hutchcroft's stronger operator-threshold conjecture, establishing $p_c<p_{2\to2}\le p_u$.

Claims

SOLUTION CLAIMED OP-00700 — A nonuniqueness phase on every nonamenable transitive graph
Full resolution · fidelity not yet established

Files and sources

Paper
math @ 1581d4c, build/main.tex ↗
Posted on GitHub
6 October 2026

No verification run is on record for this version.