Strictly Temporally Periodic Points in Cellular Automata

We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for almost equicontinuous surjective cellular automata while it is empty for the positively expansive ones. In the class of additive cellular automata, the set of strictly periodic points can be either dense or empty. The latter happens if and only if the cellular automaton is topologically transitive.

💡 Research Summary

Cellular automata (CA) are discrete dynamical systems defined on a lattice where each cell updates synchronously according to a local rule. A configuration is temporally periodic if, after a finite number of global steps t > 0, the system returns to the same configuration; it is spatially periodic if a shift by some distance s > 0 leaves the configuration unchanged. The authors introduce the notion of a strictly temporally periodic point (STPP): a configuration that is temporally periodic but not spatially periodic. While temporal and spatial periodicities have been extensively studied, STPPs have received little attention, and their distribution reveals subtle aspects of CA dynamics.

The paper focuses on surjective CA, i.e., those for which every configuration has at least one pre‑image. Surjectivity is equivalent to the absence of Garden‑of‑Eden configurations and is a natural setting for studying periodic points because it guarantees the existence of backward orbits. Within this class the authors examine three major dynamical regimes: (i) almost equicontinuous CA, (ii) positively expansive CA, and (iii) additive (linear) CA.

Almost equicontinuous surjective CA.
Equicontinuity means that arbitrarily small perturbations of an initial configuration remain small for all future times; almost equicontinuity relaxes this to the existence of a dense set of equicontinuity points. The authors exploit the density of equicontinuity points together with the concept of a blocking word—a finite pattern that forces a region of the configuration to evolve independently of its surroundings. By inserting appropriate blocking words into any open neighbourhood, they construct configurations that are temporally periodic with a prescribed period while simultaneously breaking any possible spatial period. This construction shows that for any non‑empty open set there exists an STPP, i.e., the set of STPPs is dense in the full shift. The result highlights that near‑equicontinuous dynamics, although not fully regular, still admit a rich collection of non‑trivial periodic behaviours.

Positively expansive surjective CA.
Positive expansivity is a strong form of chaos: there exists a constant c > 0 such that any two distinct configurations become at least distance c apart after some finite number of steps. In this regime the authors prove that STPPs cannot exist. The argument proceeds by assuming a configuration x is temporally periodic with period t but not spatially periodic. Positive expansivity forces the existence of a pair of distinct shifts of x that separate beyond c within fewer than t steps, contradicting the periodicity of x. Consequently every temporally periodic configuration in a positively expansive CA must also be spatially periodic, and the STPP set is empty. This result aligns with the intuition that expansive systems rapidly destroy any delicate structure that would allow a configuration to be periodic in time without being periodic in space.

Additive (linear) CA.
Additive CA are defined over a finite abelian group (typically ℤₘ) with a local rule that is a linear combination of neighbour states modulo m. Their linearity permits a complete algebraic description of the global map. The authors show that for additive CA the STPP set exhibits a dichotomy: it is either dense or empty, and the criterion is precisely topological transitivity. If the CA is topologically transitive—meaning that for any two non‑empty open sets U, V there exists a time n with Fⁿ(U) ∩ V ≠ ∅—then the system can shift any local pattern arbitrarily far, precluding the existence of non‑spatially periodic temporal cycles; thus the STPP set is empty. Conversely, when the additive CA fails to be transitive, one can construct non‑trivial linear combinations that yield configurations with a finite temporal period but no spatial period, making the STPP set dense. The authors give explicit constructions based on the kernel of the global linear map and on the decomposition of the underlying module into cyclic components.

Implications and future directions.
The paper establishes STPPs as a sensitive indicator of the underlying dynamical regime. In almost equicontinuous CA, the abundance of STPPs reflects a balance between regularity and complexity; in positively expansive CA, their absence confirms the overwhelming chaotic expansion; in additive CA, the presence or absence of STPPs is equivalent to the classical dichotomy between transitive and non‑transitive linear dynamics. These findings enrich the taxonomy of CA beyond the traditional classifications (equicontinuous, sensitive, expansive, transitive) and suggest several avenues for further research: (1) extending the analysis to non‑surjective or higher‑dimensional CA; (2) investigating quantitative measures such as the density of STPPs versus topological entropy; (3) exploring algorithmic aspects, e.g., decidability of STPP existence for a given rule; and (4) relating STPPs to computational universality, since the ability to sustain non‑spatial periodic temporal cycles may be linked to the capacity for information storage. Overall, the work provides a clear and rigorous treatment of a previously overlooked class of periodic points, offering new tools for understanding the intricate behaviour of cellular automata.