Enumeration conjecture for symmetry-group orders of two-step rules

Let Q\mathcal Q be the class of two-step rules, and let N\mathcal N_\ell denote the set of rules in Q\mathcal Q whose symmetry group has order \ell, with =\ell=\infty allowed. Symmetry-group enumeration conjecture.

N4=1084,N6=443,N8=146,|\mathcal N_4|=1084,\qquad |\mathcal N_6|=443,\qquad |\mathcal N_8|=146, N10=66,N12=6,N=5164.|\mathcal N_{10}|=66,\qquad |\mathcal N_{12}|=6,\qquad |\mathcal N_\infty|=5164.

These values come from the paper's computational classification of 6909 non-trivial quarter-plane models; the supplied source gives no resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Nicholas R. Beaton, “Walks obeying two-step rules on the square lattice: full, half and quarter planes”, arXiv:2010.06955 (2021).

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.