The monotonicity conjecture for wired percolation on the Kertész line

For q[1,)q\in[1,\infty), let pc(q,h)p_c(q,h) be the critical edge parameter and let ϕp,q,h,Zd1\phi^1_{p,q,h,\mathbb{Z}^d} denote the wired random-cluster measure. The wired-percolation monotonicity conjecture. The map

hϕpc(q,h),q,h,Zd1[0]h\longmapsto\phi^1_{p_c(q,h),q,h,\mathbb{Z}^d}[0\leftrightarrow\infty]

is decreasing. This concerns the infinite-cluster probability along the Kertész line; the source presents it as an open problem for all q1q\geq1.

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

No solutions have been posted yet.