arXiv:2611.17358v1 Announce Type: new Abstract: We study $n$-dimensional recurrences on $\mathbb{N}^n$ over finite $p$-groups. The rules are ordered products of group endomorphisms, with a $p$-automatic additional sequence and compatible $p$-automatic boundary data. For finite, nonempty, lexicographically positive predecessor sets, we prove automaticity whenever at most one coordinate contains entries of both signs. This covers all such systems for $n=1$ and $n=2$. For $n\ge3$, lexicographic positivity alone is insufficient: a fixed three-dimensional recurrence with a single nonzero boundary value is nonautomatic in base $p$ for every prime $p$. For nonnegative predecessors, we give a direct automaton construction and explicit state bounds in the abelian case. Negative coordinates are treated using algebraic power-series division, lifting modulo prime powers, central subgroups and boundary-preserving coordinate changes. A two-parameter family with a specified rule and a single boundary seed admits an exact automaticity criterion modulo prime powers. We also give nonabelian examples and finite computational certificates, including a proof of a previously proposed formula counting nonzero Delannoy residues modulo $27$.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page