The polynomial-exponent limit conjecture for running times

Less than 1 year old · traced to

Let HH be an infection rule and let MH(n)M_H(n) denote its maximum running time. Polynomial-exponent limit conjecture. The limit

lim⁡n→∞log⁡MH(n)log⁡n\lim_{n\rightarrow\infty}\frac{\log M_H(n)}{\log n}

exists for every infection rule HH.

The paper does not know whether maximum running times are approximately polynomial. Existence of this limit would assign every infection rule a well-defined polynomial growth exponent, including constant, logarithmic and intermediate regimes.

References

Primary source

David Fabian, Patrick Morris and Tibor Szabó, “Graph bootstrap percolation – a discovery of slowness”, arXiv:2602.12736 (2026).

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.