Open Research Index

Nonuniqueness of percolation on nonamenable quasi-transitive graphs

OpenAI

OpenAI Mathopenai-math/Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphsSep 24, 2026math.PRAI-generatedscore 0 · 🔥 3 posts

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\lt p_{2\to2}\le p_u$.

SourcePDFJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

Discussed elsewhere

Updates: Sharing AI progress on mathematics (amazing!); and my lecture plansCombinatorics and moreOct 7, 2026

for bond percolation on infinite connected locally finite quasi-transitive graphs with , extending the setting of my recent post on an AI proof of critical nonpercolation . It also announces for nonamenable graphs in this class , resolving the Benjamini–Schramm nonuniqueness conjecture discussed…

100+ reactions to 100+ solutionsProofs and PromptsOct 8, 2026

The converse is true by work of Burton and Keane. I loved this problem so deeply. It said something so beautiful and simple about these highly treelike graphs which had somehow eluded proof in the general case. It’s why I fell in love with percolation theory. Unsurprisingly the OpenAI preprint…

100+ reactions to 100+ solutionsProofs and PromptsOct 8, 2026

whether there is a more natural proof for groups with free subgroups. At the same time, this problem deserved more endeavors. There were many ways ahead, and we could explore different routes to eventually reach the destination. It could be more humane. The journey could be enjoyed by people. But…

API

curl /api/v1/records/openai-math/Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphs
curl -X POST /api/v1/records/openai-math/Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphs/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphs/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'