The exact minimum percolating-set size conjecture for 4-neighbour bootstrap percolation on hypercubes

From papers

Let QdQ_d be the dd-dimensional hypercube, and let m(Qd;4)m(Q_d;4) denote the minimum cardinality of a set that percolates under the 44-neighbour bootstrap process on QdQ_d. Exact-size conjecture. For all d4d\geq4 with d5d\neq5,

m(Qd;4)=d(d2+3d+14)24+1.m(Q_d;4)=\left\lceil\frac{d(d^2+3d+14)}{24}\right\rceil+1.

The paper states that this would extend the main theorem to all d4d\geq4 except d=5d=5, which was ruled out by exhaustive computer search; the claim is presented as a conjectural extension because the authors have proved it only for some values of dd.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jonathan A. Noel, “Optimal and Near-Optimal Constructions for Bootstrap Percolation in Hypercubes”, arXiv:2604.15534 (2026).

Solutions 0

No solutions have been posted yet.