Searcharxiv⌕ Search

arXiv · 2610.12014

Finite bases for Brandt semirings and naturally semilattice-ordered inverse semigroups

Abstract

We prove that Brandt semirings over nontrivial groups with at least two indices admit no identity basis with a bounded number of variables. A uniform family of finite witnesses has size linear in the variable bound and applies to groups of arbitrary cardinality. A commutative construction yields the corresponding result for flat extensions of groups of unbounded exponent and gives an exact finite basis criterion for arbitrary flat group extensions. Structural representations lead to a classification of finite natural inverse semirings and a single identity characterizing locally Clifford natural inverse structure among regular semirings. We also describe products, orthogonal sums, minimum generators, colored graph identities and linear variable complexity. Further results concern infinite generating algebras and inherent nonfinite basability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaolei Shao, Mengya Yue. 2026-10-08. Finite bases for Brandt semirings and naturally semilattice-ordered inverse semigroups. https://searcharxiv.com/abs/2610.12014

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗