Benevides–Griffiths–Przykucki conjecture on maximum percolation time
Statement
Let denote the maximum percolation time in two-dimensional bootstrap percolation on the -dimensional grid . For fixed , the conjecture is
Benevides–Griffiths–Przykucki conjecture. For all fixed ,
The lower bound is sharp for , where it gives the constant ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.