Score: 0
A short proof of a bound on the size of finite irreducible semigroups of rational matrices
Published: January 6, 2026 |
arXiv ID: 2601.03206v1
By: Benjamin Steinberg
Potential Business Impact:
Makes math rules for computer chips simpler.
Business Areas:
Quantum Computing
Science and Engineering
I give a short proof of a recent result due to Kiefer and Ryzhikov showing that a finite irreducible semigroup of $n\times n$ matrices has cardinality at most $3^{n^2}$.
Similar Papers
94%
The asymptotic size of finite irreducible semigroups of rational matrices
Formal Languages and Automata Theory
Finds the biggest possible math groups of computer instructions.
3 Jan 2026
0
86%
Integral Matrices of Fixed Rank over Number Fields
Number Theory
Finds patterns in math for better computer codes.
13 Oct 2025
0
85%
Real and finite field versions of Chebotarev's theorem
Numerical Analysis
Makes computers understand secret codes better.
3 Jun 2025
0