OpenAlex ·

Equational Theories of Interval Semirings of Posets

Zidong Gao and Yilin Zhou

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

Abstract

We study the equational theory and subvariety structure of the ai-semiring variety $\V_\infty$ generated by all flat semirings $S(a_1\cdots a_k)$, where the letters \(a_i\) are pairwise distinct. Using interval semirings of posets, we characterize its subdirectly irreducible members and describe variety membership in terms of jointly separating families of strict order-preserving maps. We obtain explicit finite identity bases for \(\V_\infty\) and each $\V_k$ generated by $S(a_1\cdots a_k)$. Consequently, every flat semiring \(S(W)\) associated with a nonempty set \(W\) of linear words is finitely based. This yields finitely based ai-semirings with exactly \(k\)-nilpotent multiplicative reduct for each \(k\geq 1\). For each \(k\geq 1\), let \(\B_k\) be the subvariety of \(\V_\infty\) defined by the \((k+1)\)-nilpotent identity. We prove that each \(\B_k\) is generated by a finite interval semiring and that every proper subvariety of \(\V_\infty\) is contained in some \(\B_k\). The variety \(\B_3\) is a Cross variety with exactly \(11\) subvarieties, whereas \([\V_k,\B_k]\), \([\V_k,\V_{k+1}]\), and \([\B_{k-1},\B_k]\) each contain continuum many subvarieties for every $k\geq 4$. In particular, this provides infinitely many finitely based finite semirings $S(a_1\cdots a_k)$ whose generated variety has continuum many subvarieties for every \(k\geq 5\).

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