Related papers: Around Gromov's injectivity lemma and applications…
Gottschalk's surjunctivity conjecture for a group $G$ states that it is impossible for cellular automata (CA) over the universe $G$ with finite alphabet to produce strict embeddings of the full shift into itself. A group universe $G$…
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…
We explore the dual version of Gottschalk's conjecture recently introduced by Capobianco, Kari, and Taati, and the notion of dual surjunctivity in general. We show that dual surjunctive groups satisfy Kaplansky's direct finiteness…
A group is surjunctive if every injective cellular automaton on it is also surjective. Gottschalk famously conjectured that all groups are surjunctive. This remains a central open problem in symbolic dynamics and descriptive set theory.…
We produce for arbitrary non-amenable group $G$ and field $K$ a non-pre-injective, surjective linear cellular automaton. This answers positively Open Problem (OP-14) in Ceccherini-Silberstein and Coornaert's monograph "Cellular Automata and…
We prove that a group $G$ is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over $G$ is injective.
Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories.
We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an…
Let $G$ be a group. Let $X$ be an algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of rational points of $X$. We study algebraic group cellular automata $\tau \colon A^G \to A^G$ whose local defining map is…
Let $S$ be a cancellative left-amenable semigroup and let $A$ be a finite set. We prove that every pre-injective cellular automaton $\tau \colon A^S \to A^S$ is surjective.
Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases…
We establish generalizations of the well-known surjunctivity theorem of Gromov and Weiss as well as the dual-surjunctivity theorem of Capobianco, Kari and Taati for cellular automata (CA) to local perturbations of CA over sofic group…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
The Besicovitch pseudodistance measures the relative size of the set of points where two functions take different values; the quotient space modulo the induced equivalence relation is endowed with a natural metric. We study the behavior of…
We introduce the class of strongly sofic monoids. This class of monoids strictly contains the class of sofic groups and is a proper subclass of the class of sofic monoids. We define and investigate sofic topological entropy for actions of…
Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
Let $G$ be an amenable group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift then $X$ has the Myhill property, that is, every pre-injective cellular automaton $\tau \colon X \to X$ is…
For linear non-uniform cellular automata (NUCA) over an arbitrary universe, we introduce and investigate their dual linear NUCA. Generalizing results for linear CA, we show that dynamical properties namely pre-injectivity, resp.…
Let $G$ be a group. Let $X$ be a connected algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of $K$-points of $X$. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular…