Stable finiteness of monoid algebras and surjunctivity
Rings and Algebras
2024-05-29 v1 Dynamical Systems
Logic
Abstract
A monoid is said to be surjunctive if every injective cellular automaton with finite alphabet over is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field and any surjunctive monoid , every one-sided invertible square matrix with entries in the monoid algebra is two-sided invertible. Our proof uses first-order model theory.
Cite
@article{arxiv.2405.18287,
title = {Stable finiteness of monoid algebras and surjunctivity},
author = {Tullio Ceccherini-Silberstein and Michel Coornaert and Xuan Kien Phung},
journal= {arXiv preprint arXiv:2405.18287},
year = {2024}
}
Comments
18 page