OpenAlex ·
The finite basis problem for flat semirings $S_c(W)$, $M_c(W)$ and $M(W)$
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.40155
- Original
- Read it at the publisher
- Topics
Abstract
We study the finite basis problem for flat semirings of the forms \(S_c(W)\), \(M_c(W)\), and \(M(W)\), where \(W\) is a nonempty set of words in a free commutative semigroup, a free commutative monoid, and a free monoid, respectively. We completely classify such flat semirings with respect to the finite basis property, allowing \(W\) to be infinite. We prove that \(S_c(W)\) is finitely based if and only if every word in \(W\) is either a cube of a letter or has length at most two, whereas \(M_c(W)\) and \(M(W)\) are finitely based if and only if \(W\) consists solely of the empty word. As applications, we recover the nonfinite basability of \(\flat(\mathbb{Z})\) and the max-plus semiring \((\mathbb{Z},\max,+)\).
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
The twisted convolution identity and ghost $r$-SICs from finite quantum dilogarithms
The Derived Algebra of Nonlinear Polynomial Divergence-Free Vector Fields
An elementary proof of the 2-regularity of Pythagorean triples
The sixth moment of the Riemann zeta function
Sharp spherical extension theorem in $\mathbb F_q^{2m}$ and applications
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.