OpenAlex ·

Nonfinitely based intervals of power semiring varieties

Xiaolei Shao and Zidong Gao

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

Abstract

We study intervals in the lattice of additively idempotent semiring varieties associated with power semirings of finite groups. We prove that every variety lying above the nonempty power semiring of a finite group of order at least three and below a variety generated by finitely many full power semirings of finite groups is nonfinitely based. In fact, none of these varieties admits an identity basis with a fixed finite bound on the number of variables. In particular, adjoining the empty set gives an interval consisting entirely of nonfinitely based varieties. We also construct equational upper bounds that are closed under zero adjunction and yield further intervals with the same property. The proof combines finite commutative quotient semirings, a cardinality estimate for kernel blockers over finite modules, and a uniform estimate for fibres of ordered products in finite groups. As a consequence, the full power semiring of a finite group is finitely based precisely when the group has at most two elements.

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