On injective endomorphisms of symbolic schemes

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 this more general setting. We also establish several new ones regarding the closed image property, surjunctivity, reversibility, and invertibility for cellular automata over algebraic varieties with coefficients in an algebraically closed field. As a byproduct, we obtain a negative answer to a question raised in [7] on the existence of a bijective complex affine algebraic cellular automaton $\tau \colon A^{\mathbb Z} \to A^{\mathbb Z}$ whose inverse is not algebraic

Finite self-similar p-groups with abelian first level stabilizers

We determine all finite p-groups that admit a faithful, self-similar action on the p-ary rooted tree such that the first level stabilizer is abelian. A group is in this class if and only if it is a split extension of an elementary abelian p-group by a cyclic group of order p. The proof is based on use of virtual endomorphisms. In this context the result says that if G is a finite p-group with abelian subgroup H of index p, then there exists a virtual endomorphism of G with trivial core and domain H if and only if G is a split extension of H and H is an elementary abelian p-group.Comment: one direction of theorem 2 extended to regular p-group

Combinatorial models of expanding dynamical systems

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally defined "Julia set" of the generalized dynamical systems depends only on the associated iterated monodromy group. We show then that the Julia set of every expanding dynamical system is an inverse limit of simplicial complexes constructed by inductive cut-and-paste rules.Comment: The new version differs substantially from the first one. Many parts are moved to other (mostly future) papers, the main open question of the first version is solve

On algebraic cellular automata

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 uncountable and algebraically closed, we prove that such cellular automata always have a closed image with respect to the prodiscrete topology on the space of configurations and that they are reversible as soon as they are bijective

A Garden of Eden theorem for Anosov diffeomorphisms on tori

Let $f$ be an Anosov diffeomorphism of the $n$-dimensional torus ${\mathbb{T}}^n$ and $\tau$ a continuous self-mapping of ${\mathbb{T}}^n$ commuting with $f$. We prove that $\tau$ is surjective if and only if the restriction of $\tau$ to each homoclinicity class of $f$ is injective.Comment: 9 page