Maximal spanning time for neighborhood growth on the Hamming plane
Abstract
We consider a long-range growth dynamics on the two-dimensional integer lattice, initialized by a finite set of occupied points. Subsequently, a site x becomes occupied if the pair consisting of the counts of occupied sites along the entire horizontal and vertical lines through x lies outside a fixed Young diagram Z. We study the extremal quantity μ(Z), the maximal finite time at which the lattice is fully occupied. We give an upper bound on μ(Z) that is linear in the area of the bounding rectangle of Z, and a lower bound s-1, where s is the side length of the largest square contained in Z. We give more precise results for a restricted family of initial sets, and for a simplified version of the dynamics.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.