SearcharxivSearch

arXiv · 2510.06854

Limit varieties of aperiodic monoids

Abstract

A limit variety is a variety that is minimal with respect to being non-finitely based. We present a new limit variety of aperiodic monoid. We also show that if there exists any other limit variety of aperiodic monoids, then it is contained in the joint of the variety $\mathbb B^1$ of all idempotent monoids and certain finitely generated variety $\mathbb E^1$ with $\mathbb B^1 \wedge \mathbb E^1 = \mathbb L_2^1$, where $\mathbb L_2^1$ is the variety of left-zero monoids. Jackson and Lee proved that $\mathbb E^1$ is HFB, that is, its every subvariety is finitely based. We exend this result a step up the classical decomposition $\mathbb B^1=\bigcup_{i \ge 2} \mathbb L^1_i$ by showing that $\mathbb E^1 \vee \overline{\mathbb E^1} \vee \mathbb L^1_3$ is also HFB, where $\overline{\mathbb E^1}$ is the variety dual of $\mathbb E^1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Sergey V. Gusev, Olga B. Sapir. 2025-10-08. Limit varieties of aperiodic monoids. https://arxiv.org/abs/2510.06854

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