OpenAlex ·

Inherently nonfinitely based additively idempotent semirings

Miao Miao Ren, Meng Ya Yue and Yi Lin Zhou

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.27641
Original
Read it at the publisher
Topics
Computational ComplexityNumber Theory

Abstract

We establish a sufficient condition for an additively idempotent semiring to be inherently nonfinitely based: if its generated variety is locally finite and every Zimin word is minimal in the additive order, then it is contained in no finitely based locally finite variety. We characterize Zimin minimality by the membership of a countable flat factor semiring $\Finf$ in the generated variety and prove that $\V(\Finf)$ is a minimal inherently nonfinitely based variety. We also obtain general restrictions on the additive order of finite inherently nonfinitely based ai-semirings. As applications, the six-element ai-semirings $\A$ and $\B$ are shown to be inherently nonfinitely based. Finally, we prove that the six-element ai semiring $\Abar$ is not inherently nonfinitely based and is finitely based. Its multiplicative reduct is inherently nonfinitely based; thus, to the best of our knowledge, $\Abar$ is the first finitely based ai-semiring with an inherently nonfinitely based multiplicative reduct.

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.

Already a reader? Sign in

All new papers in Computational Complexity

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.

Papers belong to their authors and publishers; every page here links to the original. All research topics