SearcharxivSearch

arXiv · 2207.05490

The Burnside ai-semiring variety defined by $x^n\approx x$

Abstract

Let ${\bf Sr}(n, 1)$ denote the ai-semiring variety defined by the identity $x^n\approx x$, where $n>1$. We characterize all subdirectly irreducible members of a semisimple subvariety of ${\bf Sr}(n, 1)$. Based on this result, we prove that ${\bf Sr}(n, 1)$ is hereditarily finitely based (resp., hereditarily finitely generated) if and only if $n<4$ and that the lattice of subvarieties of ${\bf Sr}(n, 1)$ is countable if and only if $n<4$. Also, we show that the class of all locally finite members of ${\bf Sr}(n, 1)$ forms a variety and so we affirmatively answer the restricted Burnside problem for ${\bf Sr}(n, 1)$. 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).

Explore related subjects

Keep this discovery

BibTeXRIS

Miaomiao Ren, Xianzhong Zhao, Mikhail V. Volkov. 2022-07-12. The Burnside ai-semiring variety defined by $x^n\approx x$. https://arxiv.org/abs/2207.05490

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR