Signs-model conjecture for connectivity of the three-dimensional hypercube
For , let be the three-dimensional hypercube and let be the class of 1-independent percolation models on in which every edge is open with probability at least . In the signs model, vertices are independently assigned signs and , and an edge is open exactly when its endpoints have the same sign.
Signs-model conjecture. Among models in , the signs model minimises the probability that is connected.
The statement is based on computational evidence and is presented as unknown in the supplied text.
References
Primary source
Paul Balister, Tom Johnston, Michael Savery and Alex Scott, “Improved bounds for 1-independent percolation on Z^n”, arXiv:2206.12335 (2025).
Progress summary
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.