Searcharxiv⌕ Search

arXiv subjects

Qingrui Yin

Publications and source records attributed to Qingrui Yin.

2 recordsLinked to original sources

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↗