Three-dimensional critical-family universality conjecture for bootstrap percolation

Let U\mathcal U be a critical three-dimensional family, and let Lc(U,p)L_c(\mathcal U,p) denote its critical length at probability pp. As p0p\rightarrow 0, either

logLc(U,p)=pΘ(1),\log L_c(\mathcal U,p)=p^{-\Theta(1)},

or

loglogLc(U,p)=pΘ(1).\log\log L_c(\mathcal U,p)=p^{-\Theta(1)}.

Critical-family universality conjecture. As p0p\rightarrow 0, either

logLc(U,p)=pΘ(1),\log L_c(\mathcal U,p)=p^{-\Theta(1)},

or

loglogLc(U,p)=pΘ(1).\log\log L_c(\mathcal U,p)=p^{-\Theta(1)}.

This is a weaker universality prediction for critical bootstrap-percolation families in dimension three. The corresponding universality result is known in dimension two, while proving a result of this kind in three or higher dimensions is described as an open problem.

Sources & referencesView supporting material

Primary source

Daniel Blanquicett, “Anisotropic bootstrap percolation in three dimensions”, arXiv:1908.11556 (2019).

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.