Searcharxiv⌕ Search

arXiv subjects

Aifa Wang

Publications and source records attributed to Aifa Wang.

10 recordsLinked to original sources

The Finite Basis Problem for Multiplicatively Idempotent Semirings

The variety of semirings satisfying $x^2\approx x$ is hereditarily finitely based in the signature consisting of addition and multiplication, without designated constants. Multiplication may be noncommutative, and the semirings need not be finite. A subdirect decomposition reduces the proof to the subvarieties defined by $3x\approx x$ and $3x\approx2x$. In the latter case, we express each polynomial identity using a common doubled part and isolated word occurrences. Four fixed identities align the first- and last-occurrence words of these occurrences. Induction on their content extracts protected identities. The associated word identities define a band variety, to which the finite basis theorem for bands applies.

math.RA↗

Mal'cev products of rings satisfying $x^n\approx x$ and idempotent semirings

Let $\Rn$ be the variety of rings satisfying $x^n\eqid x$, where $n\geq2$, and let $\W$ be a variety of idempotent semirings with commutative addition. The equality $\Rn\circ\W=\Rn\vee\W$ holds, and this variety has subvariety lattice $L(\Rn)\times L(\W)$. Its subdirectly irreducible members that are not additively idempotent have exactly one nontrivial ring component, which is a finite field. Such a member is determined by this field and an idempotent semiring with a multiplicative identity; a separation condition on unary polynomial functions of the latter characterizes subdirect irreducibility. Every subvariety has a finite identity basis. A four-element semiring generates a variety with subdirectly irreducible members of unbounded cardinality. The results extend the Mal'cev product theorem of Wang and Shao from the absorption subvariety to arbitrary $\W\leq\Slp$.

math.GR↗

Finite bases for full power semirings of finite nilpotent semigroups

We investigate finite equational bases for full power semirings of finite semigroups, including the empty set, in the constant-free signature with addition and multiplication. For a nontrivial finite nilpotent semigroup, we associate a finite relational structure recording the ordered products that are nonzero. We prove that the full power semiring is finitely based if and only if this structure has finite duality, and relate this condition to first-order definability and dismantling of the square of its core. Quantitative bounds connect obstruction size with the number of variables required in an identity basis. In the commutative case of nilpotency index $d$, the criterion reduces to the existence of an element with nonzero $(d-1)$st power. We also establish a nonfinite-basis obstruction for semigroups with a two-element group ideal and prove a finite lifting theorem. These results yield a direct-product criterion and a five-element counterexample to sufficiency of the identity-fibre condition. The arguments use equational logic, finite relational duality, and explicit algebraic constructions.

math.GR↗

The Finite Basis Problem for Semirings of Order Four

The finite basis problem for small semirings differs from its semigroup counterpart even in order three. Recent work classifies several additive types of four-element additively idempotent semirings, including all 386 semirings whose additive reduct is a chain. We consider all four-element semirings with commutative addition, in the binary signature without named constants. Combining the existing classifications with structural reductions and polynomial normal forms, we obtain 2284 finitely based and 57 nonfinitely based isomorphism types among the 2341 types. The nonfinitely based cases consist of 45 additively idempotent semirings and twelve with nonidempotent addition. The positive arguments give explicit bases or finite constructions with specified bounds. The negative arguments use cited results, term retractions and a hypergraph obstruction. A complete catalogue records the applicable result for each representative; separate correspondence tables identify precisely the cases supplied by the earlier classifications.

math.GR↗

A separating identity for matrix semirings over $S_7$

Jiao and Ren proved that the varieties generated by the matrix semirings $\M_n(S_7)$ form an ascending chain of nonfinitely based varieties, and asked whether consecutive members are equal for all $n\geq2$. We give a negative answer by exhibiting an identity in five variables that holds in $\M_2(S_7)$ and fails in $\M_3(S_7)$. Consequently, $\V(\M_2(S_7))$ is a proper subvariety of $\V(\M_n(S_7))$ for every $n\geq3$. The proof uses the cubic-power property established by Jiao and Ren and a description of products equal to the constant matrix $[a]_n$. The identity forces two distinct indices to exhaust the index set in dimension two; an additional index yields an explicit counterexample in dimension three.

math.RA↗

The strong nonfinite basis property of $S_7$

We prove that the three-element additively idempotent semiring $S_7$ is strongly nonfinitely based: every finite additively idempotent semiring whose generated variety contains $S_7$ has no finite equational basis. This answers Problem~1.2 in Yue, Ren and Gao's paper Explicit equational bases for the power semirings of $S_7$ affirmatively. The proof combines a rigidity property of set systems with private points and a probabilistic construction derived from semilinear sets of letter counts in finite semigroups. The argument allows arbitrary polynomial substitutions and does not assume commutative multiplication. As consequences, both power semirings of the multiplicative reduct of $S_7$, and both power semirings of every finite group of order at least three, are strongly nonfinitely based. All algebras are considered in the signature $(+,\cdot)$ without nullary operations.

math.RA↗

Compatible additions on a six-element commutative semigroup: equational bases and subvariety lattices

Let $M$ be the six-element commutative semigroup occurring as the common multiplicative reduct of the semirings $SR_6$ and $TR_6$. The closing paragraph of Shao, Ren, and Gao~\cite{ShaoRenGao2026} asks for the finite-basis and subvariety questions for the four remaining compatible additions on $M$. We answer these questions for the four isomorphism types $R_{01},R_{02},R_{11},R_{12}$. First, we classify all compatible additions on $M$: there are nine labelled additions and six isomorphism types, parametrized by $R_{ij}$ with $0\leq i\leq j\leq 2$. For each of the four new types we give a graph-theoretic criterion for every identity, an explicit infinite basis, and a proof of nonfinite basability. The generated varieties $\V(R_{01})$ and $\V(R_{02})$ have eleven subvarieties each, while $\V(R_{11})$ has sixty-six. The lattice $\Sub(\V(R_{12}))$ is countably infinite. Every identity in this variety reduces to a subset of twenty-five fixed identities together with two monotone path families $γ_n$ and $\gammaD_n$. This yields a canonical signature $(H,p,q)$, complete normal forms, explicit meet and join operations, and a formula for all covers. There are 153 fixed nodes, 43 one-parameter families, and 9 two-parameter families; exactly eighteen subvarieties are finitely based, and the unique limit subvariety is $\V(SR_6)$. The strong nonfinite-basis status of the four finite semirings remains open.

math.GR↗

The finite basis problem for varieties generated by all semirings of a fixed order

Let $\Avar_n$ and $\VV_n$ be the varieties generated by all $n$-element additively idempotent semirings (ai-semirings) and all $n$-element semirings with commutative addition, respectively, in the signature $(+,\cdot)$ without constants. We prove that both varieties are finitely based if and only if $n\leq2$. The five-element case follows from cyclic identities and a structural analysis of products of squares. For $n\geq6$, each variety contains a finite inherently nonfinitely based ai-semiring. We also prove $\VV_n\cap\AI=\Avar_n$ for every $n$, where $\AI$ is the variety of all ai-semirings.

math.RA↗

The variety generated by all semirings of order three is nonfinitely based

We prove that the variety generated by all semirings of order three is nonfinitely based, where addition is not required to be commutative and the signature has no constants. The same conclusion holds for the variety generated by all additively idempotent semirings of order three. We establish these conclusions by excluding a uniform bound on the number of variables in an identity basis. Our proof uses identities associated with anchored odd cycles. Three small commutative test semirings isolate a polynomial equivalence class consisting of exactly two polynomials. For a cycle of length $n$, every first nontrivial deduction between them requires an identity with at least $n+1$ variables, even under polynomial substitutions. A retraction followed by a band quotient transfers absorption identities to arbitrary addition and identifies the ai-subvariety of the full joint variety with the joint variety of the ai-generators. Validity of the cycle identities follows from a structural analysis of chain and flat addition. An elementary sixth-power lemma for semigroups of order at most three supplies the retraction.

math.GR↗

On the variety generated by all semirings of order two

There are ten distinct two-element semirings up to isomorphism, denoted \( L_2, R_2, M_2, D_2, N_2, T_2, Z_2, W_2, Z_7 \), and \( Z_8 \) (see \cite{bk}). Among these, the multiplicative reductions of \( M_2, D_2, W_2 \), and \( Z_8 \) form semilattices, while the additive reductions of \( L_2, R_2, M_2, D_2, N_2 \), and \( T_2 \) are idempotent semilattices, commonly referred to as \emph{idempotent semirings}. In 2015, Vechtomov and Petrov \cite{vp} studied the variety generated by \( M_2, D_2, W_2 \), and \( Z_8 \), proving that it is finitely based. In the same year, Shao and Ren \cite{srii} examined the variety generated by the six idempotent semirings, demonstrating that every subvariety of this variety is finitely based. This paper systematically investigates the variety generated by all ten two-element semirings. We prove that this variety contains exactly 480 subvarieties, each of which is finitely based.

math.GR↗