相关论文: The Myhill property for cellular automata on amena…

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…

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…

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 $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 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…

When $G$ is an arbitrary group and $V$ is a finite-dimensional vector space, it is known that every bijective linear cellular automaton $\tau \colon V^G \to V^G$ is reversible and that the image of every linear cellular automaton $\tau…

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…

Gottschalk's surjunctivity conjecture states that for all group universes and finite alphabets, every equivariant and continuous selfmap of the full shift, known as cellular automaton, cannot be a strict embedding. Not all surjective…

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…

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.…

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…

We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily…

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.

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 provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non…

We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When the ground field is assumed to be…

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…

Following ideas developed by Misha Gromov, we investigate surjunctivity and reversibility properties of cellular automata defined over certain concrete categories.

This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…

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…