ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Md(n)M^d(n) denote the maximum percolation time in two-dimensional bootstrap percolation on the dd-dimensional grid [n]d[n]^d. For fixed d≥1d\geq 1, the conjecture is

Md(n)=6d2−5d−118n2+O(n).M^d(n)=\frac{6d^2-5d-1}{18}n^2+O(n).

Benevides–Griffiths–Przykucki conjecture. For all fixed d≥1d\geq 1,

Md(n)=6d2−5d−118n2+O(n).M^d(n)=\frac{6d^2-5d-1}{18}n^2+O(n).

The lower bound is sharp for d=2d=2, where it gives the constant 13/1813/18; the conjecture asserts that the same asymptotic formula gives the maximum percolation time in every fixed dimension.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.