A short proof of a bound on the size of finite irreducible semigroups of rational matrices
Benjamin Steinberg

TL;DR
This paper provides a concise proof of a recent mathematical result establishing an upper bound on the size of finite irreducible semigroups of rational matrices, specifically that their cardinality does not exceed 3^{n^2}.
Contribution
The paper introduces a shorter proof of the known bound on the size of finite irreducible semigroups of rational matrices, simplifying previous arguments.
Findings
Finite irreducible semigroups of n×n matrices have at most 3^{n^2} elements.
The proof is notably shorter than previous demonstrations.
The result confirms the upper bound on the size of such semigroups.
Abstract
I give a short proof of a recent result due to Kiefer and Ryzhikov showing that a finite irreducible semigroup of matrices has cardinality at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Limits and Structures in Graph Theory · Commutative Algebra and Its Applications
