Polygonal limiting-shape conjecture for the splitting automaton

Let the splitting automaton evolve on Zd\mathbb Z^d with parameter hh, and let nn be its size parameter. A limiting shape is the deterministic rescaled asymptotic shape of the occupied set, as defined in the paper.

Polygonal limiting-shape conjecture. For every

\nh[134d+2,1),\nh\in\left[1-\frac{3}{4d+2},1\right),

there exists n0n_0 such that, for every n>n0n>n_0, the limiting shape is a polygon depending only on hh and dd.

The conjecture is motivated by simulations showing many possible shapes as hh varies, together with cases in which changing nn affects the observed behavior. The existence and asserted parameter-independence of the limiting polygon remain open in the stated range.

Sources & referencesView supporting material

Primary source

Anne Fey and Haiyan Liu, “Limiting shapes for a non-abelian sandpile growth model and related cellular automata”, arXiv:1006.4928 (2010).

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.