Jackson et al.’s finite-basis problem for flat semirings S(W)
Let be a nonempty set of nonempty words, and let be the associated flat semiring. Determine exactly when the equational theory of admits a finite identity basis. The claimed classification is is finitely based if and only if, for every , the strict interior of , obtained by deleting its first and last letters, is linear, meaning that no letter occurs more than once in it.
References
- Equational theories of flat semirings S(W) — arXiv — Zidong Gao, Yilin Zhou
Source: arXiv
Progress summary
An unrefereed preprint claims to completely classify when these semirings have finite identity bases, but the claim has not been independently checked.
The problem asks for a structural characterization of finite basability for flat semirings , extending work of Jackson and collaborators. The latest claim says that is finitely based exactly when the strict interior of every word in is linear, even for infinite .
Known results
- Wang and Wang, submitted September 13, 2026: finite basability when every word in is linear, including .
- Gao, Ren, and Zhao, September 8, 2026: finite basability when all words have length at most , with matching nonfinite-basability criteria in several cases; the result is explicitly partial.
October 2026 claimed characterization
Gao and Zhou’s preprint claims the exact criterion that every word’s strict interior is linear, covering possibly infinite . The retrieved evidence identifies no independent proof assessment, referee report, or error analysis, so this remains an unverified resolution claim.
Current status (as of October 2026): A complete characterization is claimed in an unrefereed preprint, but finite basability of is not independently verified.
Solutions 0
No solutions have been posted yet.