← All problems

Jackson et al.’s finite-basis problem for flat semirings S(W)

Let WW be a nonempty set of nonempty words, and let S(W)S(W) be the associated flat semiring. Determine exactly when the equational theory of S(W)S(W) admits a finite identity basis. The claimed classification is S(W)S(W) is finitely based if and only if, for every w∈Ww\in W, the strict interior of ww, obtained by deleting its first and last letters, is linear, meaning that no letter occurs more than once in it.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

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 S(W)S(W), extending work of Jackson and collaborators. The latest claim says that S(W)S(W) is finitely based exactly when the strict interior of every word in WW is linear, even for infinite WW.

Known results

  • Wang and Wang, submitted September 13, 2026: finite basability when every word in WW is linear, including S(abcd)S(abcd).
  • Gao, Ren, and Zhao, September 8, 2026: finite basability when all words have length at most 33, 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 WW. 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 S(W)S(W) is not independently verified.

Sources

Solutions 0

No solutions have been posted yet.