The monotonicity conjecture for wired percolation on the Kertész line
The monotonicity conjecture for wired percolation on the Kertész line
For , let be the critical edge parameter and let denote the wired random-cluster measure. The wired-percolation monotonicity conjecture. The map
is decreasing. This concerns the infinite-cluster probability along the Kertész line; the source presents it as an open problem for all .
Sources & referencesView supporting material
Primary source
Ulrik Thinggaard Hansen and Frederik Ravn Klausen, “Strict monotonicity, continuity and bounds on the Kertész line for the random-cluster model on Z^d”, arXiv:2206.07033 (2023).
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
Sign in to submit a solution.
No solutions have been posted yet.