Searcharxiv⌕ Search

arXiv · 2610.06351

Equational Theories of Interval Semirings of Posets

Abstract

We study the equational theory and subvariety structure of the ai-semiring variety $\V_\infty$ generated by all flat semirings $S(a_1\cdots a_k)$, where the letters \(a_i\) are pairwise distinct. Using interval semirings of posets, we characterize its subdirectly irreducible members and describe variety membership in terms of jointly separating families of strict order-preserving maps. We obtain explicit finite identity bases for \(\V_\infty\) and each $\V_k$ generated by $S(a_1\cdots a_k)$. Consequently, every flat semiring \(S(W)\) associated with a nonempty set \(W\) of linear words is finitely based. This yields finitely based ai-semirings with exactly \(k\)-nilpotent multiplicative reduct for each \(k\geq 1\). For each \(k\geq 1\), let \(\B_k\) be the subvariety of \(\V_\infty\) defined by the \((k+1)\)-nilpotent identity. We prove that each \(\B_k\) is generated by a finite interval semiring and that every proper subvariety of \(\V_\infty\) is contained in some \(\B_k\). The variety \(\B_3\) is a Cross variety with exactly \(11\) subvarieties, whereas \([\V_k,\B_k]\), \([\V_k,\V_{k+1}]\), and \([\B_{k-1},\B_k]\) each contain continuum many subvarieties for every $k\geq 4$. In particular, this provides infinitely many finitely based finite semirings $S(a_1\cdots a_k)$ whose generated variety has continuum many subvarieties for every \(k\geq 5\).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zidong Gao, Yilin Zhou. 2026-10-05. Equational Theories of Interval Semirings of Posets. https://arxiv.org/abs/2610.06351

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Unsolved Problems in Group Theory. The Kourovka Notebook

This is a collection of open problems in group theory proposed by hundreds of mathematicians from all over the world. It has been published every 2--4 years since 1965. This is the 21st edition, which contains 150 new problems and a number of comments on problems from the previous editions.

math.GR↗

On embeddings of the difference graph of the intersection power graph and the power graph

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The intersection power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices $x$, $y$ are adjacent if $\langle x\rangle \cap \langle y \rangle \neq \{e\}$. The difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the intersection power graph $\mathcal{G}_{1}(G)$ and power graph $\mathcal{P}(G)$ with all isolated vertices removed. We characterized all the finite nilpotent groups $G$ such that the difference graph is planar. Further, we determine all the finite nilpotent groups whose difference graph has genus at most $2$. Moreover, we prove that there does not exist any group whose difference graph is projective planar.

math.GR↗

Soficity of One-Relator Groups and Reducible Presentations

We prove that every one-relator group is sofic, answering a question of Nate Brown. More generally, every group admitting a reducible presentation without proper powers is sofic, with one proper-power relation allowed at the final reducible step. The proof starts from the endpoint-preserving edge replacements of Poulin--Wróbel. We retain the free-group word carried by each terminal replacement and use it to define an \(F(S)\)-valued cocycle repair; in its relative form, the repair preserves the previously chosen generator coordinates while controlling the new relator defect. Coinduction transports the lower cocycle through successive one-relator-product extensions, allowing the construction to be iterated along reducible presentations. For a final relator \(w^m\), cyclic translates of the repaired set amplify a zero-defect set of measure close to \(1/m\) to one of measure close to one. A cocycle criterion then converts arbitrarily small relator defect into finite permutation approximations via a treeable skew-product orbit relation.

math.GR↗