In this paper
AbstractIntroductionPreliminaries and the main theoremEndpoint theories and a basis for the upper endpointSix relative absorption rulesThe six-type reductionThe seven-element intervalThe degenerate casesThe one-element semigroupNontrivial left-zero semigroupsNontrivial null semigroupsTwo-generated free algebras and basis ranksThe opposite semigroupAcknowledgementsReferencesWorksMathematics
A seven-element interval of power-semiring varieties
Abstract
We determine the interval between the varieties generated by the nonempty and full power semirings of a semigroup satisfying . It has two elements for a one-element semigroup, three for a nontrivial left-zero or null semigroup, and seven otherwise, without any finiteness assumption. In the seven-element case the interval is [\Rvar,\Rvar^0], where \Rvar=\Mod_{\rm ai}\{xy\approx xz\} and \Rvar^0 is its zero-adjunction variety. Every word absorption valid in \Rvar but not in \Rvar^0 is equivalent over \Rvar^0 to one of six relative identities. We give exact absorption criteria and finite bases for all seven varieties. Three have basis rank two and four have basis rank three; their two-generated free algebras have orders , , or . We also count the finite-rank free algebras of both endpoints.
Introduction
We work with additively idempotent semirings in the signature , without named constants. For a semigroup , let and denote its nonempty and full power semirings, with union and setwise multiplication. Thus is obtained from by adjoining the empty set as an additively least multiplicative zero. Put
Yue, Ren, and Gao [9, Problem 1.3] ask for the cardinality of . They prove that it is when is the multiplicative reduct of [9 Theorem 5.2].
We determine for every semigroup satisfying
Such a semigroup has multiplication , where . The interval has two elements if , three if is a nontrivial left-zero or null semigroup, and seven if and . In the last case both endpoint varieties are generated by the power semirings of the three-element subsemigroup
Table 1.2.
The lower endpoint in this case is
Yue, Ren, Zeng, and Shao established its finite generation [10 Proposition 4.5 and Remark 4.6]; Yue and Ren determined its ten-element subvariety lattice and proved that it is a Cross variety [8 Lemma 2.1, Theorem 2.7 and Corollary 2.8]. Here we determine the interval , where is generated by the zero extensions of members of .
The proof classifies the relative identities of these endpoints. Every word absorption valid in but not in reduces, over , to one of six identities. Exact absorption criteria distinguish the resulting varieties and establish their inclusion relations. The criteria follow from word normal forms and invariants under substitutions and term contexts; explicit substitutions give the six-type reduction. All seven varieties are finitely based.
2020 Mathematics Subject Classification. 08B05, 16Y60, 20M07.
Key words and phrases. power semiring, additively idempotent semiring, variety interval, zero adjunction, equational basis, basis rank.
Corresponding author: Aifa Wang. We also determine their basis ranks. The seven varieties have only three distinct two-variable equational theories, with two-generated free algebras of orders 15, 24, and 35. Three varieties are generated by these free algebras; the other four require three free generators. Counting formulas for the endpoint free algebras follow from their normal forms.
The upper-endpoint absorption criterion is a specialization of the zero-adjunction criterion of Wu, Ren, and Zhao [7 Proposition 1.5], restated in Gao, Ren, and Zhao [2 Proposition 2.1]. The latter paper also shows that zero adjunction preserves equality of generated varieties. Together with the known four-element generator of , this gives a five-element generator of (Proposition 3.4). For finite groups of order at least three, Shao and Gao [6 Corollary 1.2] prove that every variety in the corresponding power-semiring interval has infinite axiomatic rank and is nonfinitely based; their denotes the nonempty power semiring. Related classifications for semilattice-ordered semigroups and normal bands appear in Kuřil and Polák [4] and Kuřil [3]. Ren and Zhao [5] determine a nine-element variety lattice under and . For general variety theory we refer to Burris and Sankappanavar [1].
Preliminaries and the main theorem
Let AI denote the variety of additively idempotent semirings in the signature . For terms , , write
Every term is, by distributivity and additive idempotence, a finite nonempty sum of nonempty words. We identify such a polynomial with its finite set of word summands and write for membership in that set. For a word , let , , and denote its length, first variable, and content, respectively. A word of length one is called a one-letter word; a word of length at least two is called a long word. For , where is a finite nonempty variable set, fix a long word with first variable and content . For , take ; otherwise take followed by the remaining elements of in some fixed order. For a polynomial , set
Theorem 2.1 (classification). Let be a semigroup satisfying . Then there is an idempotent map such that , and
In the last case the interval is, up to isomorphism, the seven-element lattice described in Theorem 6.1 below.
Proof. If with , then
so the operation is associative and . Conversely, if , define . Taking gives , whence and . This proves the structural assertion. The nondegenerate case of the cardinality assertion is proved in Theorem 6.1; all remaining cases are proved in Section 7.
For the remainder of the paper put
The symbol denotes the variety generated by an algebra, and denotes the class of algebras in AI satisfying . All inclusions of varieties are in this fixed signature. The cardinality of an interval includes its endpoints. For an ai-semiring , let be obtained by adjoining a new additively least multiplicative zero, with the original operations on unchanged. For a variety , put
The zero is an element of these algebras, not a named constant in the signature. In particular, .
Endpoint theories and a basis for the upper endpoint
Assume throughout this section and Sections 4–6 that
Since an idempotent surjective map is the identity, choose , put , and choose . The set is a subsemigroup, with multiplication table (1.2). In particular, the endpoint theories of every such are already visible on this three-element subsemigroup.
Lemma 3.1 (endpoint absorption criterion). For every polynomial ,
If is a long word with first variable and content , then
whereas
Consequently and .
Proof. Write for the direct image of a subset. For nonempty variable sets , every long word evaluates in to
In the full power semiring the same formula holds when for every . Its value is empty if for some . This proves the sufficiency of (3.2)–(3.4).
For necessity it is enough to use the three-element table (1.2). If , assign and every other variable the value . Every right-hand long summand has value or , and every right-hand one-letter summand has value . Thus does not contain , whereas does. If , assign and all other variables . The long left-hand word has value , while the right-hand side is contained in . Finally, if the condition in (3.4) fails, assign variables outside the empty set, assign the set , and assign the remaining variables of the set . The left-hand word has value ; surviving right-hand long words cannot start with , so no right-hand summand contains . Every identity is equivalent to word absorptions in both directions. The criteria therefore describe the entire endpoint theories, both for and for , proving the final assertion. □
Proposition 3.2 (finite basis for ). Relative to the axioms of AI, the upper endpoint has the basis
Proof. The four identities hold in by the endpoint computation. The identity , applied to prefixes and in right contexts, permutes any adjacent pair of letters after the first position. The identity removes repetitions in those positions. If a word contains a variable other than its first variable, tail permutation followed by removes extra occurrences of the first variable. A word whose content is reduces to , since follows from the first identity. Thus every long word reduces to .
Write a long word as with both factors nonempty. Substituting in the last identity gives . If long words have the same first variable and , append the missing variables to and normalize to obtain . Lemma 3.1 now derives every word absorption valid in . An identity between sums is equivalent to absorbing every summand of each side into the other side, proving completeness. □
We shall repeatedly use two consequences: every long word satisfies in , and whenever . These follow by the same normal forms.
Remark 3.3 (the lower endpoint). The lower endpoint in the nondegenerate case is the already studied variety
Indeed, implies by putting , and then every long word reduces to the square of its first variable. The criterion (6)–(7) shows that no additional identity identifies distinct - or -data. Thus (10) follows. This endpoint is the variety R (denoted by R) studied by Yue and Ren [8]; its finite generation is due to Yue, Ren, Zeng, and Shao [10], and its ten-element subvariety lattice and Cross property are given in [8 Theorem 2.7 and Corollary 2.8].
Proposition 3.4 (zero-adjunction description and a small generator). Under (5),
If is the four-element ai-semiring in [8 Table 4 and Lemma 2.1], then
In particular, the upper endpoint is generated by a five-element algebra.
Proof. Remark 3.3 gives , and [8 Lemma 2.1] gives . By the general zero-adjunction result [2 Corollaries 2.2 and 2.3], for every ai-semiring . Applying it to and to yields
Since zero adjunction adds one new element, . □
Remark 3.5. The five-element generator in Proposition 3.4 is not asserted to be free. The orders of free algebras and the least number of free generators needed to generate each interval variety are determined in Sections 6 and 8.
Six relative absorption rules
Define the following six identities, all written as absorptions:
Let for among these six rules. Every rule in (11) holds in .
Fix a finite nonempty set of variables and . For a polynomial , define
Thus and may be witnessed by a one-letter word, while must be witnessed by a long word.
Lemma 4.1 (contextual invariants). Every identity valid in preserves the seven data , , , , , , . After arbitrary polynomial substitutions and insertion into an arbitrary one-hole term context, the two sides of one of the rules in (11) preserve the data in the
following table:
Proof. If holds in , (3.2)–(3.4) say that the one-letter summands agree and each long summand of either side is covered by a long summand on the other side with the same first variable and smaller content. Thus agree, and so do . This applies in particular to any substituted and contextual instance of an identity of .
Consider a rule , regarded as , and a substitution . Expanding a one-hole context by distributivity expresses its polynomial as a common part together with finitely many pieces or . Here are possibly empty words; this notation does not introduce constants into the signature. Since the second expansion is contained in the first, it suffices to transfer every witness supplied by a deleted summand to a summand common to both sides.
For , a deleted summand has the form , with , . For any , the common expansion contains . These are long words with the same first variable. For , a deleted summand has the same form, but now are chosen independently; choose to get the same protection. All substituted polynomials are nonempty, so exists. Thus all six rules preserve , and they preserve because every deleted summand is long.
For , the common summand has the same first variable and smaller content than , so it protects . The common long summand protects , since its content is contained in that of the deleted summand. This also proves -preservation for . For , protects , even when the two selected words differ. For , protects .
For , suppose the deleted summand witnesses . The common summand also has content in . If it is long, it witnesses . Otherwise and is a variable in . The common right-hand side contains both , from , and , from . Hence , which witnesses . Already existing -witnesses are preserved because are. Therefore is preserved.
Applying these transfers to every deleted summand proves equality of the specified data on the two sides of each elementary replacement. It applies to replacements in either direction. Induction on an equational derivation proves the assertion. □
Theorem 4.2 (exact relative criteria). For every in (4.1), absorption of a one-letter word in is characterized by (3.2). For a long word , the necessary and sufficient conditions for are
In particular, .
Proof. The necessity of is (3.2), and the necessity of is (3.3). The remaining necessities follow from Lemma 4.1: the left-hand word itself witnesses the relevant data, and every derivation from the defining rule must preserve that data. Equational completeness turns this non-derivability statement into failure in the corresponding variety.
For sufficiency, choose a long summand with first variable , and choose an auxiliary word whose content contains all variables needed to ensure . For , substitute
, and use to obtain . If holds, choose a witness and use in ; since , , and hence . The same substitution with an internal long witness and proves the -case.
For , if is witnessed by a long word, (8) already applies. Otherwise ; with , the identity , together with and , gives the result. For , the only additional case is again . Choose an internal long witness for , use , and obtain
Finally suppose that applies. If holds, use an internal long witness , substitute , and use to get
If holds, choose , and choose a long right-hand word with first variable . Taking to contain the contents of both and , the substitution gives
This proves all rows of (14). The last row is exactly the endpoint criterion (7), so .
The six-type reduction
Theorem 5.1 (six types). Let be a word and a polynomial. Suppose that but . Then the absorption is equivalent, over , to exactly one of the six rules in (11). More precisely, with , the six mutually exclusive cases are
Here all predicates refer to .
Proof. By Lemma 3.1, is long and . Call a word internal if its content is contained in , and external otherwise. The failure of (8) says that no internal long right-hand word starts with . Hence, in the strict situation, is equivalent to . In particular implies , and or implies , proving exhaustiveness and mutual exclusivity of the cases in (15).
In each case below, a substitution gives ; the second absorption is derived using only the identities of .
The cases with . An internal long right-hand word starts with a variable other than , so . Use
The left side normalizes to . Internal long words and internal one-letter words other than are absorbed by . An external word whose image starts with contains and is absorbed by ; if its image starts with , it is absorbed by . The possible one-letter summand contributes . Thus if holds and otherwise. These are and , respectively.
The case . Map internal variables to and external variables to . The left side becomes . Every internal right-hand word is one-letter and becomes , while every external word becomes a long word with first variable and content . Thus , giving .
The case . Put . Here and . Use
The left side becomes , since its content includes and some element of . Internal right-hand words are one-letter summands from , so they become . External words whose first variable is in are absorbed by ; all other external words are absorbed by . Thus , giving .
The case . Since holds and fails, is again nonempty. Use the preceding substitution. Now , since fails. No external long word starts in , and an external one-letter word cannot lie in . Consequently , giving .
The case . Map internal variables to and external variables to . Every right-hand word contains an external variable and normalizes to , whereas the left side normalizes to . This gives .
In each row, the indicated rule implies the original absorption by Theorem 4.2. The rules are pairwise inequivalent, as will follow from the separation argument in Theorem 6.1.
The seven-element interval
Theorem 6.1 (the lattice). Under the nondegeneracy assumption (3.1),
and the covering relations are
The varieties and are incomparable. The Hasse diagram is shown in Figure 1.

Figure 1. The seven-element interval, ordered by inclusion.
Proof. The implications between the six rules are
For example, in put , to obtain ; put and use the upper identities to obtain . Conversely, and give
so together they are equivalent to . Also implies , hence .
Let be any variety in the interval. An identity between sums is equivalent to its word absorptions. Since , every absorption valid in is valid in . Remove the absorptions already valid in . Theorem 5.1 replaces each remaining absorption by one of the six rules, and (6.3) reduces every set of rules to no rule or to exactly one of the six displayed nodes. Thus there are at most seven varieties. All seven candidates are distinct. The rule fails in under , , in (1.2): the left side contains and the right side does not. For the other separations, the predicates associated with the left-hand word and right-hand polynomial of each rule are
| 1 | 1 | 1 | 1 | |
| 0 | 1 | 0 | 1 | |
| 1 | 0 | 1 | 1 | |
| 0 | 0 | 1 | 1 | |
| 0 | 0 | 0 | 1 | |
| 0 | 0 | 0 | 0 |
Table 1 (PDF p. 8).
The first-variable condition holds in every row. Thus (14) shows that fails in both and , while fails in both and . This proves incomparability of . The rule fails in each of these two varieties, fails in , and fails in . All relations in (17) are therefore strict. Since the seven candidates exhaust the interval, they are covering relations. □
Corollary 6.2 (finite bases). Relative to AI, the seven varieties have the finite bases
where . Every displayed basis uses at most three variables.
Proof. Combine Proposition 3.2 with Theorem 6.1. The standard axioms for AI also use at most three variables. □
Proposition 6.3 (free-algebra counts). For , let be the free -generated algebra in a variety in the seven-element interval. Let be the number of antichains, including the empty antichain, in the subset lattice of an -element set. Then
In particular,
Proof. For a fixed first variable , the contents of long words all contain . Removing , the inclusion-minimal contents that remain form an antichain in the subset lattice on the other variables. The upper criterion (8) shows that this antichain uniquely determines the long-word contribution with first variable , up to the identities of ; the one-letter summand is an independent choice. Thus there are choices for each . The criteria distinguish all these choices, and every choice is represented by a polynomial unless no summand at all is selected. This proves the first count. In , only the independent choices of membership in and in remain, giving . For , the two-element subset lattice has six antichains, so (6.5) gives and . □
Corollary 6.4 (finite generation by a three-generated algebra). For every ,
Proof. The algebra is a quotient of , hence finite. The subsets and generate , since and addition is union. Since , freeness makes it a homomorphic image of . Lemma 3.1 therefore gives . By freeness, and have the same identities in at most three variables. The rules in (4.1) separate all seven interval elements, so no two distinct nodes can occur between and with the same three-variable theory. Thus . □
The degenerate cases
Let , , and . In , a word is the meet of its variables, and hence
This criterion follows by assigning variables in the value one and all other variables zero.
The one-element semigroup
If , then is the one-element semiring and . Every nontrivial distributive lattice contains a two-element sublattice: from two distinct elements, take their meet if necessary and retain a comparable pair. Thus every nontrivial subvariety of D contains , and the interval has exactly two elements.
Nontrivial left-zero semigroups
Suppose and . Write and . Every word has the value of its first variable when its content variables are nonempty, and is empty otherwise. Consequently,
For necessity of the second criterion, take distinct ; assign the first variable of the set , the other content variables , and outside variables the empty set. If no covering word exists, the right side avoids . For the lower criterion use nonempty singleton assignments throughout. The sufficiency follows from the word evaluation. In particular : all words reduce to their first variables, and the criterion distinguishes the remaining sums. The upper endpoint has the relative basis
Put . Then
To justify the basis (7.3), tail permutation and idempotence reduce each word to its first variable and content. The inequality absorbs larger content into smaller content with the same first variable. The upper criterion in (7.2) proves completeness.
We now prove (7.4). The subsemiring gives , and holds in both and . If an absorption holds in these two varieties, choose a right-hand word starting with and a right-hand word with , using (7.2) and (7.1). If , the upper criterion already proves the absorption. Otherwise write and use with :
It follows that all identities of follow from (7.3) and , proving the equality in (7.4).
For exhaustiveness, take any strict absorption valid in but not . Put and . Map to , variables in to , and outside variables to . A right-hand word starting with must be external, so its image is absorbed by . Words starting with other internal variables are absorbed by ; those starting with outside variables are absorbed by . The left side becomes if , and otherwise. In the latter case still yields . Thus every proper subvariety of containing is contained in .
If an absorption valid in fails in , it fails in ; by (7.1) every right-hand word is external. Mapping internal variables to and external variables to gives . Together with (7.3) this yields , and hence . Any proper subvariety of containing has such a separating absorption, so must equal . Finally , because fails ; and fails in at . This proves the strict three-element chain.
Nontrivial null semigroups
Suppose , write for the common product, and assume . Let denote the two endpoints. A long word evaluates to when all its variables are nonempty and to the empty set otherwise. Hence
for every long word . For both endpoints a one-letter absorption holds exactly when . To see its necessity, choose , assign the value , and all other variables . For necessity in (7.5), assign every internal variable ; use also outside for the lower endpoint, and the empty set outside for the upper endpoint. When the corresponding condition fails, the right side avoids . The upper endpoint has the relative basis
Let . Then
For completeness of (27), commutativity and the third identity let us square all letters in a long word; the second identity removes higher powers. Thus a long word with content reduces to . The last identity absorbs larger content into smaller content. These reductions derive exactly (26), and the one-letter criterion then proves completeness.
The subsemiring gives , and holds in both and . If a long absorption holds in both, (26) supplies a long right-hand word and (22) supplies an internal right-hand word. An internal long word already gives the upper criterion. Otherwise choose an internal one-letter summand and a long right-hand summand . Substitution in gives
The one-letter absorptions are already upper identities, so this proves the relative basis in (28).
For a strict absorption valid in but not , the left side must be long and there is no internal long right-hand word. Map variables in its content to and all outside variables to . The left side becomes . Internal one-letter summands become , and every external summand is absorbed by . Thus the absorption implies , so every proper intermediate variety is contained in .
If an absorption valid in fails in , it fails in , and therefore has no internal right-hand word. The same substitution gives . Swapping variables gives equality of all squares. By (27), for any we have ; all long products consequently coincide. Every identity of now follows from (26) and the one-letter criterion, so this additional identity defines over . This excludes any further variety below .
Finally , since holds in but fails in ; and fails in at . This proves (28) and completes the proof of Theorem 2.1.
Two-generated free algebras and basis ranks
Throughout this section assume (5). Let and be a two-element left-zero semigroup and a two-element null semigroup, respectively. Write and , and retain from Section 7.
Proposition 8.1 (join descriptions). The intermediate varieties admit the descriptions
Proof. An identity holds in a join of varieties if and only if it holds in each of them. For a long word , the lower endpoint requires for the absorption . The additional requirements from are, respectively, , by (22), (26), and (23). These are exactly the rows for in (14). For a one-letter word, the condition from already requires that word to occur as a summand, which suffices in every variety. This proves the first three descriptions. The last two follow from Theorem 6.1.
Lemma 8.2 (two-variable theories). There are natural isomorphisms
The orders are 35 and 24, respectively, while .
Proof. Consider an absorption in at most two variables that holds in but fails in . By Lemma 3.1, is long and some long summand of starts with . If contained every variable occurring in the absorption, that summand would give the upper criterion, a contradiction. Thus . There is no internal long right-hand word, and the predicates , , all reduce to the condition . Theorem 5.1 therefore assigns such an absorption to or , according as that condition holds or fails. The varieties , , satisfy neither of these rules, and , , satisfy but not . They consequently have the same identities in at most two variables within each of these two groups. Their free algebras on two named generators have identical defining congruences, proving (8.2).
The values 35 and 15 follow from Proposition 6.3, since . To obtain 24, write the two generators as , . The six possible contributions with first variable in an upper normal form are: no summand, , , , , and . The rule identifies precisely the last two contributions. Indeed holds in , and gives the reverse absorption after adding . The criteria in Theorem 4.2 distinguish the other choices independently for each first variable: , distinguish all but and , and these remain distinct when is absent as a one-letter summand. There are therefore five choices for each of the two first variables. Excluding the choice with no summand at all gives .
For a variety generated by one of its finite-rank free algebras, define its basis rank by
This measures free generation of a variety; it is distinct from the number of variables required in an identity basis.
Theorem 8.3 (exact basis ranks). The two-generated free algebras and basis ranks of the seven interval elements are as follows:
| 35 | 3 | ||
| 35 | 3 | ||
| 35 | 2 | ||
| 24 | 3 | ||
| 24 | 3 | ||
| 24 | 2 | ||
| 15 | 2 |
Table 8.3.
Proof. As observed in the proof of Corollary 6.4, the semiring is generated by , . Consequently is generated by a two-generated algebra. Write , where every product equals . The semiring is generated by , , since . The semiring is generated by its two elements.
Every two-generated member of is a homomorphic image of . The descriptions of and in Proposition 8.1 therefore give
Lemma 8.2 now proves the two middle columns of (8.3) for all seven varieties. For completeness, basis rank one is impossible here. Proposition 6.3 gives . Every between them is thus the same three-element algebra, represented by , , ; every product in this algebra equals . In particular it is commutative, while contains the noncommutative semiring . Thus . The strict inclusions in Theorem 6.1 and (8.3) exclude rank two for exactly four nodes. Corollary 6.4 supplies rank at most three for each, completing the table.
The opposite semigroup
The classification also applies to semigroups satisfying . If denotes the opposite semigroup, then
Reversing multiplication induces a lattice isomorphism . Theorem 2.1 therefore gives the same 2, 3, 7 classification, with right-zero semigroups in place of left-zero semigroups.
Acknowledgements
This work was supported by the Science and Technology Research Program of the Chongqing Municipal Education Commission (Grant No. KJZD-K2024011102) and the Joint Fund for Innovation and Development of the Chongqing Natural Science Foundation (Chongqing Municipal Education Commission) (Grant No. CSTB2025NSCQ-LZX0067).
References
(Aifa Wang) School of Mathematical Sciences, Chongqing University of Technology, Chongqing 400054, P.R. China
Email address: [email protected]
(Lili Wang) School of Mathematical Sciences, Chongqing University of Technology, Chongqing 400054, P.R. China
Email address: [email protected]
(Qingrui Yin) School of Mathematical Sciences, Chongqing University of Technology, Chongqing 400054, P.R. China
Email address: [email protected]
References
- [1]Stanley Burris and H. P. Sankappanavar, A course in universal algebra, Graduate Texts in Mathematics, vol. 78, Springer-Verlag, New York, 1981.
- [2]Zidong Gao, Miaomiao Ren, and Xianzhong Zhao, A continuum in the lattice of semiring varieties: the interval [V(S), V(S⁰)], Preprint, 2026, arXiv:2609.24514.arxiv.org/abs/2609.24514
- [3]Martin Kuřil, Admissible closure operators and varieties of semilattice-ordered normal bands, Acta Sci. Math. (Szeged) 83 (2017), no. 1–2, 35–50, doi:10.1432/actasm-016-777-4.DOI
- [4]Martin Kuřil and Libor Polák, On varieties of semilattice-ordered semigroups, Semigroup Forum 71 (2005), no. 1, 27–48.DOI
- [5]Miaomiao Ren and Xianzhong Zhao, The varieties of semilattice-ordered semigroups satisfying x³ ≈ x and xy ≈ yx, Period. Math. Hungar. 72 (2016), no. 2, 158–170.DOI
- [6]Xiaolei Shao and Zidong Gao, Nonfinitely based intervals of power semiring varieties, Preprint, 2026, arXiv:2609.26019.arxiv.org/abs/2609.26019
- [7]Y. N. Wu, Miaomiao Ren, and Xianzhong Zhao, The additively idempotent semiring S₇⁰ is nonfinitely based, Semigroup Forum 108 (2024), no. 2, 479–487.
- [8]Mengya Yue and Miaomiao Ren, Every additively idempotent semiring satisfying xy ≈ xz is finitely based, Preprint, 2025, arXiv:2509.16711.arxiv.org/abs/2509.16711
- [9]Mengya Yue, Miaomiao Ren, and Zidong Gao, Explicit equational bases for the power semirings of S₇, Preprint, 2026, arXiv:2609.19957.arxiv.org/abs/2609.19957
- [10]Mengya Yue, Miaomiao Ren, L. L. Zeng, and Y. Shao, The finite basis problem for additively idempotent semirings of order four, II, Algebra Universalis (2025), doi:10.1007/s00012-025-00908-5.