pith. sign in

arxiv: 1002.3957 · v1 · pith:5SF5WXHEnew · submitted 2010-02-21 · 🧮 math.DS · math.GR

A Garden of Eden theorem for linear subshifts

classification 🧮 math.DS math.GR
keywords linearautomatoncellularcolonirreducibleprovestronglysubset
0
0 comments X
read the original abstract

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 cellular automaton, then $\tau$ is surjective if and only if it is pre-injective. We also prove that if $G$ is countable and $X \subset V^G$ is a strongly irreducible linear subshift, then every injective linear cellular automaton $\tau \colon X \to X$ is surjective.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.