Related papers: Around Gromov's injectivity lemma and applications…

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…

Let $X$ be a compact metrizable group and $\Gamma$ a countable group acting on $X$ by continuous group automorphisms. We give sufficient conditions under which the dynamical system $(X,\Gamma)$ is surjunctive, i.e., every injective…

While the surjectivity of the global map in two-dimensional cellular automata (2D CA) is undecidable in general, in specific cases one can often decide if the rule is surjective or not. We attempt to classify as many 2D CA as possible by…

We prove the Moore and the Myhill property for strongly irreducible subshifts over right amenable and finitely right generated left homogeneous spaces with finite stabilisers. Both properties together mean that the global transition…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

Let $G$ be an amenable group and let $V$ be a finite-dimensional vector space over an arbitrary field $\K$. We prove that if $X \subset V^G$ is a strongly irreducible linear subshift of finite type and $\tau \colon X \to X$ is a linear…

We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…

Let $G$ be an amenable group and let $X$ be an irreducible complete algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $X$ and let $\tau \colon A^G \to A^G$ be an algebraic cellular automaton…

Let $X$ be a compact metrizable group and $\Gamma$ a countable group acting on $X$ by continuous group automorphisms. We give sufficient conditions under which the dynamical system $(X,\Gamma)$ is surjunctive, i.e., every injective…

We prove that for any finitely generated group $G$ and any $k\geq1$, the space of $k$-colorings of $G$ does not admit a strict self-embedding. This settles the Gottschalk surjunctivity conjecture and, consequently, Kaplansky's direct…

Let R be a class of groups closed under taking semidirect products with finite kernel and fully residually R-groups. We prove that R contains all R-by-{finitely generated residually finite} groups. It follows that a semidirect product of a…

We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…

Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…

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, resp. a sofic subshift, if and only if so is…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Consider the intrinsic fundamental group \`a la Grothendieck of a linear category using connected gradings. In this article we prove that any full convex subcategory is incompressible, in the sense that the group map between the…

The Besicovitch pseudo-metric is a shift-invariant pseudo-metric on the set of infinite sequences, that enjoys interesting properties and is suitable for studying the dynamics of cellular automata. They correspond to the asymptotic behavior…

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…

In this paper, we study certain dynamical properties of dill maps, a class of functions introduced in~\cite{salo2015block} that generalizes both cellular automata and substitutions. In particular, we prove that surjective uniform dill maps…