Maximal spanning time for neighborhood growth on the Hamming plane

From MaRDI portal
Publication:5232138




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 mathcalZ. We study the extremal quantity mu(mathcalZ), the maximal finite time at which the lattice is fully occupied. We give an upper bound on mu(mathcalZ) that is linear in the area of the bounding rectangle of mathcalZ, and a lower bound sqrts1, where s is the side length of the largest square contained in mathcalZ. We give more precise results for a restricted family of initial sets, and for a simplified version of the dynamics.









This page was built for publication: Maximal spanning time for neighborhood growth on the Hamming plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232138)