Two-neighbor directed percolation in all dimensions conjecture

For each dNd\in\mathbb{N}, let the 22-DnG be the directed 22-neighbor graph on Zd\mathbb{Z}^d, and let θD(2,d)\theta^{\rm D}(2,d) be its percolation probability. Two-neighbor directed percolation conjecture. The 22-DnG percolates in all dimensions dNd\in\mathbb{N}. Numerical simulations support the claim, and it would settle the open two-dimensional case together with the higher-dimensional cases; it remains open.

Sources & referencesView supporting material

Primary source

Benedikt Jahnel, Jonas Köppl, Bas Lodewijks and András Tóbiás, “Percolation in lattice k-neighbor graphs”, arXiv:2306.14888 (2024).

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.