We extend previously known two-dimensional multiplication tiling systems that simulate multiplication by two natural numbers p and q in base $pq$ to higher dimensional multiplication tessellation systems. We develop the theory of these systems and link different multiplication tessellation systems with each other via macrotile operations that glue cubes in one tessellation system into larger cubes of another tessellation system. The macrotile operations yield topological conjugacies and factor maps between cellular automata performing multiplication by positive numbers in various bases.

The box-ball system (BBS), which was introduced by Takahashi and Satsuma in 1990, is a soliton cellular automaton. Its dynamics can be linearized by a few methods, among which the best known is the Kerov–Kirillov–Reschetikhin (KKR) bijection using rigged partitions. Recently, a new linearization method in terms of ‘slot configurations’ was introduced by Ferrari–Nguyen–Rolla–Wang, but its relations to existing ones have not been clarified. In this paper, we investigate this issue and clarify the relation between the two linearizations. For this, we introduce a novel way of describing the BBS dynamics using a carrier with seat numbers. We show that the seat number configuration also linearizes the BBS and reveals explicit relations between the KKR bijection and the slot configuration. In addition, by using these explicit relations, we also show that even in case of finite carrier capacity the BBS can be linearized via the slot configuration.

Let G be a group and let V be an algebraic variety over an algebraically closed field K. Let A denote the set of K-points of V. We introduce algebraic sofic subshifts ${\Sigma \subset A^G}$ and study endomorphisms $\tau \colon \Sigma \to \Sigma $. We generalize several results for dynamical invariant sets and nilpotency of $\tau $ that are well known for finite alphabet cellular automata. Under mild assumptions, we prove that $\tau $ is nilpotent if and only if its limit set, that is, the intersection of the images of its iterates, is a singleton. If moreover G is infinite, finitely generated and $\Sigma $ is topologically mixing, we show that $\tau $ is nilpotent if and only if its limit set consists of periodic configurations and has a finite set of alphabet values.

We show that there is a distortion element in a finitely generated subgroup G of the automorphism group of the full shift, namely an element of infinite order whose word norm grows polylogarithmically. As a corollary, we obtain a lower bound on the entropy dimension of any subshift containing a copy of G, and that a sofic shift’s automorphism group contains a distortion element if and only if the sofic shift is uncountable. We obtain also that groups of Turing machines and the higher-dimensional Brin–Thompson groups $mV$ admit distortion elements; in particular, $2V$ (unlike V) does not admit a proper action on a CAT$(0)$ cube complex. In each case, the distortion element roughly corresponds to the SMART machine of Cassaigne, Ollinger, and Torres-Avilés [A small minimal aperiodic reversible Turing machine. J. Comput. System Sci. 84 (2017), 288–301].

For linear nonuniform cellular automata (NUCA) which are local perturbations of linear CA over a group universe G and a finite-dimensional vector space alphabet V over an arbitrary field k, we investigate their Dedekind finiteness property, also known as the direct finiteness property, i.e., left or right invertibility implies invertibility. We say that the group G is $L^1$-surjunctive, resp. finitely $L^1$-surjunctive, if all such linear NUCA are automatically surjective whenever they are stably injective, resp. when in addition k is finite. In parallel, we introduce the ring $D^1(k[G])$ which is the Cartesian product $k[G] \times (k[G])[G]$ as an additive group but the multiplication is twisted in the second component. The ring $D^1(k[G])$ contains naturally the group ring $k[G]$ and we obtain a dynamical characterization of its stable finiteness for every field k in terms of the finite $L^1$-surjunctivity of the group G, which holds, for example, when G is residually finite or initially subamenable. Our results extend known results in the case of CA.

We show that the image of a subshift X under various injective morphisms of symbolic algebraic varieties over monoid universes with algebraic variety alphabets is a subshift of finite type, respectively a sofic subshift, if and only if so is X. Similarly, let G be a countable monoid and let A, B be Artinian modules over a ring. We prove that for every closed subshift submodule $\Sigma \subset A^G$ and every injective G-equivariant uniformly continuous module homomorphism $\tau \colon \! \Sigma \to B^G$, a subshift $\Delta \subset \Sigma $ is of finite type, respectively sofic, if and only if so is the image $\tau (\Delta )$. Generalizations for admissible group cellular automata over admissible Artinian group structure alphabets are also obtained.

We present a new sufficient criterion to prove that a non-sofic half-synchronized subshift is direct prime. The criterion is based on conjugacy invariant properties of Fischer graphs of half-synchronized shifts. We use this criterion to show as a new result that all n-Dyck shifts are direct prime, and we also give new proofs of direct primeness of non-sofic beta-shifts and non-sofic S-gap shifts. We also construct a class of non-sofic synchronized direct prime subshifts which additionally admit reversible cellular automata with all directions sensitive.

For any infinite transitive sofic shift X we construct a reversible cellular automaton (that is, an automorphism of the shift X) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing directions. This shows in addition that every infinite transitive sofic shift has a reversible cellular automaton which is sensitive with respect to all directions. As another application we prove a finitary version of Ryan’s theorem: the automorphism group $\operatorname {\mathrm {Aut}}(X)$ contains a two-element subset whose centralizer consists only of shift maps. We also show that in the class of S-gap shifts these results do not extend beyond the sofic case.

The box-ball system (BBS) was introduced by Takahashi and Satsuma as a discrete counterpart of the Korteweg-de Vries equation. Both systems exhibit solitons whose shape and speed are conserved after collision with other solitons. We introduce a slot decomposition of ball configurations, each component being an infinite vector describing the number of size k solitons in each k-slot. The dynamics of the components is linear: the kth component moves rigidly at speed k. Let $\zeta $ be a translation-invariant family of independent random vectors under a summability condition and $\eta $ be the ball configuration with components $\zeta $ . We show that the law of $\eta $ is translation invariant and invariant for the BBS. This recipe allows us to construct a large family of invariant measures, including product measures and stationary Markov chains with ball density less than $\frac {1}{2}$ . We also show that starting BBS with an ergodic measure, the position of a tagged k-soliton at time t, divided by t converges as $t\to \infty $ to an effective speed $v_k$ . The vector of speeds satisfies a system of linear equations related with the generalised Gibbs ensemble of conservative laws.

We consider backward filtrations generated by processes coming from deterministic and probabilistic cellular automata. We prove that these filtrations are standard in the classical sense of Vershik’s theory, but we also study them from another point of view that takes into account the measure-preserving action of the shift map, for which each sigma-algebra in the filtrations is invariant. This initiates what we call the dynamical classification of factor filtrations, and the examples we study show that this classification leads to different results.

Mixing rates, relaxation rates, and decay of correlations for dynamics defined by potentials with summable variations are well understood, but little is known for non-summable variations. This paper exhibits upper bounds for these quantities for dynamics defined by potentials with square-summable variations. We obtain these bounds as corollaries of a new block coupling inequality between pairs of dynamics starting with different histories. As applications of our results, we prove a new weak invariance principle and a Hoeffding-type inequality.

Let G be a group and A a set equipped with a collection of finitary operations. We study cellular automata $$\tau :{A^G} \to {A^G}$$ that preserve the operations AG of induced componentwise from the operations of A. We show τ that is an endomorphism of AG if and only if its local function is a homomorphism. When A is entropic (i.e. all finitary operations are homomorphisms), we establish that the set EndCA(G;A), consisting of all such endomorphic cellular automata, is isomorphic to the direct limit of Hom(AS, A), where S runs among all finite subsets of G. In particular, when A is an R-module, we show that EndCA(G;A) is isomorphic to the group algebra $${\rm{End}}(A)[G]$$ . Moreover, when A is a finite Boolean algebra, we establish that the number of endomorphic cellular automata over AG admitting a memory set S is precisely $${(k|S|)^k}$$ , where k is the number of atoms of A.

We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full shift (hence a transitive subshift) that is neither almost mean equicontinuous nor mean sensitive.

In this paper we analyse the non-wandering set of one-dimensional Greenberg–Hastings cellular automaton models for excitable media with $e\geqslant 1$ excited and $r\geqslant 1$ refractory states and determine its (strictly positive) topological entropy. We show that it results from a Devaney chaotic closed invariant subset of the non-wandering set that consists of colliding and annihilating travelling waves, which is conjugate to a skew-product dynamical system of coupled shift dynamics. Moreover, we determine the remaining part of the non-wandering set explicitly as a Markov system with strictly less topological entropy that also scales differently for large $e,r$.

In this paper we continue the study of automorphism groups of constant-length substitution shifts and also their topological factors. We show that, up to conjugacy, all roots of the identity map are letter-exchanging maps, and all other non-trivial automorphisms arise from twisted compressions of another constant-length substitution. We characterize the group of roots of the identity in both the measurable and topological setting. Finally, we show that any topological factor of a constant-length substitution shift is topologically conjugate to a constant-length substitution shift via a letter-to-letter code.

Let $(X,\unicode[STIX]{x1D70E})$ be a transitive sofic shift and let $\operatorname{Aut}(X)$ denote its automorphism group. We generalize a result of Frisch, Schlank, and Tamuz to show that any normal amenable subgroup of $\operatorname{Aut}(X)$ must be contained in the subgroup generated by the shift. We also show that the result does not extend to higher dimensions by giving an example of a two-dimensional mixing shift of finite type due to Hochman whose automorphism group is amenable and not generated by the shift maps.

We show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$, where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$. Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$, we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$-invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$.

Abelian cellular automata (CAs) are CAs which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images have weak*-convergence towards the uniform Bernoulli measure (the Haar measure in this setting). We are interested in structural phenomena, i.e., randomization for a wide class of initial measures (under some mixing hypotheses). First, we prove that an abelian CA randomizes in Cesàro mean if and only if it has no soliton, i.e., a non-zero finite configuration whose time evolution remains bounded in space. This characterization generalizes previously known sufficient conditions for abelian CAs with scalar or commuting coefficients. Second, we exhibit examples of strong randomizers, i.e., abelian CAs randomizing in simple convergence; this is the first proof of this behaviour to our knowledge. We show, however, that no CA with commuting coefficients can be strongly randomizing. Finally, we show that some abelian CAs achieve partial randomization without being randomizing: the distribution of short finite words tends to the uniform distribution up to some threshold, but this convergence fails for larger words. Again this phenomenon cannot happen for abelian CAs with commuting coefficients.

Ott, Tomforde and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea, we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a result of Kitchens. As with the one-sided shifts over infinite alphabets, our shift spaces are compact Hausdorff spaces but, in contrast to the one-sided setting, our shift map is continuous everywhere. We show that many of the classical results from symbolic dynamics are still true for our two-sided shift spaces. In particular, while for one-sided shifts the problem about whether or not any $M$-step shift is conjugate to an edge shift space is open, for two-sided shifts we can give a positive answer for this question.

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.