Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stable finiteness of monoid algebras and surjunctivity

Published 28 May 2024 in math.RA, math.DS, and math.LO | (2405.18287v1)

Abstract: A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any surjunctive monoid $M$, every one-sided invertible square matrix with entries in the monoid algebra $K[M]$ is two-sided invertible. Our proof uses first-order model theory.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (3)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.