Injective linear cellular automata and sofic groups
From MaRDI portal
Publication:2480581
It is shown that sofic groups are L-surjunctive. Using a characterization of L-surjuctive proved here, it is shown that group ring (over any field) of sofic groups are stably finite and hence directly finite which is proved by \textit{G. Elek} and \textit{E. Szabó} [J. Algebra 280, No. 2, 426--434 (2004; Zbl 1078.16021)].
Recommendations
- Linear cellular automata over modules of finite length and stable finiteness of group rings
- Cellular automata, duality and sofic groups
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- scientific article; zbMATH DE number 5343230
- On a characterization of locally finite groups in terms of linear cellular automata.
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms of symbolic algebraic varieties
- scientific article; zbMATH DE number 3114014 (Why is no real title available?)
- scientific article; zbMATH DE number 3293543 (Why is no real title available?)
- On sofic groups
- Sofic groups and direct finiteness.
- Sofic groups and dynamical systems.
- The Garden of Eden theorem for linear cellular automata
Cited in
(28)- Cellular automata, duality and sofic groups
- On linear shifts of finite type and their endomorphisms
- On dual surjunctivity and applications
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- Linear cellular automata over modules of finite length and stable finiteness of group rings
- On invertible and stably reversible non-uniform cellular automata
- A garden of Eden theorem for linear subshifts
- Linear sofic groups and algebras
- On a characterization of locally finite groups in terms of linear cellular automata.
- Expansive actions on uniform spaces and surjunctive maps
- Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
- scientific article; zbMATH DE number 5343230 (Why is no real title available?)
- Induction and restriction of cellular automata
- Surjunctivity and reversibility of cellular automata over concrete categories
- Generating infinite monoids of cellular automata
- Cellular automata over algebraic structures
- On injective endomorphisms of symbolic schemes
- Hyperlinear and Sofic Groups: A Brief Guide
- A geometric generalization of Kaplansky’s direct finiteness conjecture
- Stable finiteness does not imply linear soficity
- On images of subshifts under embeddings of symbolic varieties
- On linear non-uniform cellular automata: duality and dynamics
- On the reversibility and the closed image property of linear cellular automata
- Stable finiteness of twisted group rings and noisy linear cellular automata
- Hopfian wreath products and the stable finiteness conjecture
- First-order model theory and Kaplansky's stable finiteness conjecture for surjunctive groups
- Strongly sofic monoids, sofic topological entropy, and surjunctivity
- Sofic groups and profinite topology on free groups.
This page was built for publication: Injective linear cellular automata and sofic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480581)