The Burnside ai-semiring variety defined by $x^n\approx x$
Miaomiao Ren, Xianzhong Zhao, Mikhail V. Volkov

TL;DR
This paper investigates the algebraic structure of ai-semiring varieties defined by the identity x^n ≈ x, characterizing subdirectly irreducible members, and establishing properties like hereditary finite basis, countability of subvarieties, and solutions to the restricted Burnside problem.
Contribution
It provides a complete characterization of subdirectly irreducible members and properties of the ai-semiring variety ${f Sr}(n, 1)$, including hereditarily finite basis and the restricted Burnside problem.
Findings
${f Sr}(n, 1)$ is hereditarily finitely based if and only if n<4.
The lattice of subvarieties of ${f Sr}(n, 1)$ is countable if and only if n<4.
The class of locally finite members of ${f Sr}(n, 1)$ forms a variety.
Abstract
Let denote the ai-semiring variety defined by the identity , where . We characterize all subdirectly irreducible members of a semisimple subvariety of . Based on this result, we prove that is hereditarily finitely based (resp., hereditarily finitely generated) if and only if and that the lattice of subvarieties of is countable if and only if . Also, we show that the class of all locally finite members of forms a variety and so we affirmatively answer the restricted Burnside problem for . In addition, we provide a simplified proof of the main result obtained by Gajdo\v{s} and Ku\v{r}il (Semigroup Forum 80: 92--104, 2010).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · semigroups and automata theory · Polynomial and algebraic computation
