A garden of Eden theorem for linear subshifts

DOI10.1017/S0143385710000921MaRDI QIDQ2884075zbMATHOpenAlexFDO

Authors Michel Coornaert, Tullio Ceccherini-Silberstein

Publication date 24 May 2012

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.3957

zbMATH Keywords

amenable grouplinear cellular automatalinear subshiftgarden of Eden theorem

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

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 $Xsubset{V}^G$ is a strongly irreducible linear subshift of finite type and $aucolonXoX$ is a linear cellular automaton, then $au$ is surjective if and only if it is pre-injective. We also prove that if $G$ is countable and $Xsubset{V}^G$ is a strongly irreducible linear subshift, then every injective linear cellular automaton $aucolonXoX$ is surjective.

Recommendations

• The Garden of Eden theorem for linear cellular automata
• The Garden of Eden theorem for cellular automata on group sets
• The Garden of Eden theorem: old and new
• The Garden of Eden theorem for sofic shifts
• On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties

Cites work

• scientific article; zbMATH DE number 3277970 (Why is no real title available?)
• Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
• Amenable groups and cellular automata
• Cellular automata and groups
• Cellular automata and strongly irreducible shifts of finite type.
• Endomorphisms and automorphisms of the shift dynamical system
• Endomorphisms of symbolic algebraic varieties
• Entropy and isomorphism theorems for actions of amenable groups
• Induction and restriction of cellular automata
• Injective linear cellular automata and sofic groups
• On groups with full Banach mean value
• On the reversibility and the closed image property of linear cellular automata
• Sofic groups and direct finiteness.
• The Garden of Eden theorem for linear cellular automata
• The rank of finitely generated modules over group algebras
• Topological invariants of dynamical systems and spaces of holomorphic maps. I.

Cited in

(19)

• Cellular automata between sofic tree shifts
• Surjective cellular automata far from the Garden of Eden
• Garden of Eden and specification
• The Garden of Eden theorem for linear cellular automata
• The Garden of Eden theorem: old and new
• On the Garden of Eden theorem for non-uniform cellular automata
• Linear cellular automata: Garden of Eden Theorem, L-surjunctivity and group rings
• Gardens of Eden and amenability on cellular automata
• Homoclinically expansive actions and a garden of Eden theorem for harmonic models
• The Garden of Eden theorem for cellular automata on group sets
• On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties
• About the Garden of Eden theorems for cellular automata in the hyperbolic plane
• A garden of Eden theorem for Anosov diffeomorphisms on tori
• Topological rigidity of linear cellular automaton shifts
• On linear shifts of finite type and their endomorphisms
• On the garden of Eden theorem for \(\mathscr{B}\)-free subshifts
• The Garden of Eden theorem for sofic shifts
• Cellular automata and strongly irreducible shifts of finite type.
• Semi-strongly irreducible shifts

This page was built for publication: A garden of Eden theorem for linear subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884075)