Linear recurring sequence subgroups in finite fields

AbstractGiven a finite field F and a linear recurrence relation over F it is possible to find, in a fairly “obvious” way, a finite extension L of F and a subgroup M of the multiplicative group of L such that the elements of M may be written, without repetition, so as to form a cyclically closed sequence which obeys the recurrence. Here we investigate this phenomenon for second-order recurrences; the situation in which F has prime order and the characteristic polynomial of the relation is irreducible over F is described

Spatial updating, spatial transients, and regularities of a complex automaton with nonperiodic architecture

We study the dynamics of patterns exhibited by rule 52, a totalistic cellular automaton displaying intricate behaviors and wide regions of active/inactive synchronization patches. Systematic computer simulations involving 230 initial configurations reveal that all complexity in this automaton originates from random juxtaposition of a very small number of interfaces delimiting active/inactive patches. Such interfaces are studied with a sidewise spatial updating algorithm. This novel tool allows us to prove that the interfaces found empirically are the only interfaces possible for these periods, independently of the size of the automata. The spatial updating algorithm provides an alternative way to determine the dynamics of automata of arbitrary size, a way of taking into account the complexity of the connections in the lattice

395003 (9pp)

Abstract We analyze the two possible ways of simulating complex systems with cellular automata: by using the familiar timewise updating or by using the complementary spacewise updating. Both updating algorithms operate on identical sets of initial conditions defining the state of the automaton. While timewise growth generally probes just vanishingly small sets of initial conditions producing statistical samples of the asymptotic attractors, spacewise growth operates with much restricted sets which allow one to simulate them all, exhaustively. Our main result is the derivation of an exact analytical formula to quantify precisely one of the two sources of algorithmic complexity of spacewise detection of the complete set of attractors for elementary 1D cellular automata with generic non-periodic architectures of any arbitrary size. The formula gives the total number of initial conditions that need to be investigated to locate rigorously all possible patterns for any given rule. As simple applications, we illustrate how this knowledge may be used (i) to uncover missing patterns in previous classifications in the literature and (ii) to obtain surprisingly novel patterns that are totally unreachable with the time-honored technique of artificially imposing spatially periodic boundary conditions