arXiv · 1409.1340
On surjunctive monoids
Abstract
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of marked surjunctive monoids is itself surjunctive. On the other hand, we show that the bicyclic monoid and, more generally, all monoids containing a submonoid isomorphic to the bicyclic monoid are non-surjunctive.
Explore related subjects
Keep this discovery
Tullio Ceccherini-Silberstein, Michel Coornaert. 2014-09-04. On surjunctive monoids. https://arxiv.org/abs/1409.1340
Cite the original work for its findings. Save a collection to share your selection of sources.