Cellular automata are discrete dynamical systems that consist of patterns of
symbols on a grid, which change according to a locally determined transition
rule. In this paper, we will consider cellular automata that arise from
polynomial transition rules, where the symbols in the automaton are integers
modulo some prime p. We are principally concerned with the asymptotic
behavior of the line complexity sequence aT(k), which counts, for each k,
the number of coefficient strings of length k that occur in the automaton. We
begin with the modulo 2 case. For a given polynomial $T(x) = c_0 + c_1x + …
- c_nx^nwithc_0,c_n\neq 0$, we construct odd and even parts of the
polynomial from the strings 0c1c3c5... and c0c2c4..., respectively.
We prove that for polynomials for which the odd and even parts are relatively
prime, aT(k) satisfies recursions of a specific form. We also consider
powers of transition rules modulo p, introducing a notion of the order of a
recursion. We show that the property of “having a recursion of some order” is
preserved when the transition rule is raised to a positive integer power.
Extending to a more general setting, we investigate the asymptotics of aT(k)
by considering an abstract generating function
ϕ(z)=∑k=1∞α(k)zk which satisfies a general functional
equation relating ϕ(z) and ϕ(zp) for some prime p. We show that
there is a continuous, piecewise quadratic function f on [1/p,1] for which
limk→∞(α(k)/k2−f(p−⟨logpk⟩))=0, where
⟨y⟩ denotes the fractional part of y. We use this result to
show that for certain positive integer sequences sk→∞ with a
parameter x∈[1/p,1], the ratio α(sk(x))/sk(x)2 tends to f(x),
and that the limit superior and inferior of α(k)/k2 are given by the
extremal values of f.