The finite basis problem for matrix semirings over a two-element additively idempotent semiring
Jun Jiao, Miaomiao Ren

TL;DR
This paper classifies when matrix semirings over two-element additively idempotent semirings have a finite basis, revealing that they are finitely based precisely when the base semiring is not a distributive lattice.
Contribution
It provides a complete classification of the finite basis property for matrix semirings over two-element additively idempotent semirings, a previously unresolved problem.
Findings
Matrix semirings are finitely based iff the base semiring is not a distributive lattice.
The classification applies for all matrix sizes n ≥ 2.
The main theorem characterizes the finite basis property completely.
Abstract
We provide a complete classification of matrix semirings over two-element additively idempotent semirings with respect to the finite basis property.Our main theorem shows that for every integer ,the semiring is finitely based if and only if is distinct from a distributive lattice.
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
TopicsPolynomial and algebraic computation · Fuzzy and Soft Set Theory · semigroups and automata theory
