Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
DOI10.1080/00927870701864015zbMATH Open1177.43003OpenAlexW2035696947MaRDI QIDQ3510089FDOQ3510089
Tullio Ceccherini-Silberstein, Michel Coornaert
Publication date: 26 June 2008
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927870701864015
amenable grouplinear cellular automatonArtinian moduleNoetherian modulemodule of finite lengthsemisimple modulepre-injectivity
Geometric group theory (20F65) Dynamical aspects of cellular automata (37B15) Means on groups, semigroups, etc.; amenable groups (43A07) Cellular automata (computational aspects) (68Q80) Commutative Noetherian rings and modules (13E05) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Chain conditions on other classes of submodules, ideals, subrings, etc.; coherence (associative rings and algebras) (16P70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Entropy and isomorphism theorems for actions of amenable groups
- Endomorphisms of symbolic algebraic varieties
- Mean topological dimension
- Topological invariants of dynamical systems and spaces of holomorphic maps. I.
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Injective linear cellular automata and sofic groups
- Linear cellular automata over modules of finite length and stable finiteness of group rings
Cited In (5)
- A garden of Eden theorem for linear subshifts
- Linear cellular automata over modules of finite length and stable finiteness of group rings
- Induction and restriction of cellular automata
- Hopfian wreath products and the stable finiteness conjecture
- The Myhill property for cellular automata on amenable semigroups
This page was built for publication: Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510089)