A garden of Eden theorem for linear subshifts

DOI10.1017/S0143385710000921zbMATH Open1254.37013arXiv1002.3957OpenAlexW2964141740MaRDI QIDQ2884075FDOQ2884075

Authors: Michel Coornaert, Tullio Ceccherini-Silberstein 

Publication date: 24 May 2012

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

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.

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

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

zbMATH Keywords

amenable grouplinear cellular automatalinear subshiftgarden of Eden theorem

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

Cites Work

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

Cited In (12)

• Cellular automata between sofic tree shifts
• The Garden of Eden theorem for sofic shifts
• On linear shifts of finite type and their endomorphisms
• The Garden of Eden theorem for linear cellular automata
• Semi-strongly irreducible shifts
• A garden of Eden theorem for Anosov diffeomorphisms on tori
• Gardens of Eden and amenability on cellular automata
• On the garden of Eden theorem for \(\mathscr{B}\)-free subshifts
• Cellular automata and strongly irreducible shifts of finite type.
• Garden of Eden and specification
• Homoclinically expansive actions and a garden of Eden theorem for harmonic models
• Linear cellular automata: Garden of Eden Theorem, L-surjunctivity and group rings

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)