← All problems

Critical percolation has no infinite cluster

9 years old · traced to

Let βc\beta_c denote the critical parameter for Bernoulli percolation on Zd\mathbb{Z}^d, and let Ppc\mathbb{P}_{p_c} be the corresponding critical percolation measure. Critical non-percolation conjecture. For any dgreaterthanorequalto2d greater than or equal to 2,

Ppc[0⟷∞]=0.\mathbb{P}_{p_c}[0\longleftrightarrow \infty]=0.

This is known in sufficiently high dimensions by lace-expansion methods, but remains open for d∈{3,4,5}d\in\{3,4,5\} according to the source.

References
  1. Hugo Duminil-Copin, “Lectures on the Ising and Potts models on the hypercubic lattice”, arXiv:1707.00520 (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 2

Claimed by OpenAI. For nearest-neighbor Bernoulli bond and site percolation on Z^3, each at its own critical parameter, the manuscript claims there is almost surely no infinite cluster. This addresses the page’s three-dimensional critical non-percolation case, for both specified models. The manuscript’s stated main theorem does not by itself establish the claim in every other lattice dimension.See full solutionHide full solution
Claimed by OpenAI. For critical Bernoulli BOND percolation on every infinite connected locally finite quasi-transitive graph with p_c<1, the manuscript claims no infinite cluster. This includes Z^d for every d>=2 and therefore addresses the page’s lattice question in the bond model. Its general theorem is not a site-percolation assertion or a statement for graphs with p_c=1.See full solutionHide full solution