English

Maximal spanning time for neighborhood growth on the Hamming plane

Combinatorics 2017-08-08 v1

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 xx becomes occupied if the pair consisting of the counts of occupied sites along the entire horizontal and vertical lines through xx lies outside a fixed Young diagram Z\mathcal{Z}. We study the extremal quantity μ(Z)\mu(\mathcal{Z}), the maximal finite time at which the lattice is fully occupied. We give an upper bound on μ(Z)\mu(\mathcal{Z}) that is linear in the area of the bounding rectangle of Z\mathcal{Z}, and a lower bound s1\sqrt{s-1}, where ss is the side length of the largest square contained in Z\mathcal{Z}. We give more precise results for a restricted family of initial sets, and for a simplified version of the dynamics.

Cite

@article{arxiv.1708.01855,
  title  = {Maximal spanning time for neighborhood growth on the Hamming plane},
  author = {Janko Gravner and J. E. Paguyo and Erik Slivken},
  journal= {arXiv preprint arXiv:1708.01855},
  year   = {2017}
}

Comments

22 pages, 5 figs