SearcharxivSearch

arXiv · 1009.1929

Modular and lower-modular elements of lattices of semigroup varieties

Abstract

The paper contains three main results. First, we show that if a commutative semigroup variety is a modular element of the lattice Com of all commutative semigroup varieties then it is either the variety COM of all commutative semigroups or a nil-variety or the join of a nil-variety with the variety of semilattices. Second, we prove that if a commutative nil-variety is a modular element of Com then it may be given within COM by 0-reduced and substitutive identities only. Third, we completely classify all lower-modular elements of Com. As a corollary, we prove that an element of Com is modular whenever it is lower-modular. All these results are precise analogues of results concerning modular and lower-modular elements of the lattice of all semigroup varieties obtained earlier by Jezek, McKenzie, Vernikov, and the author. As an application of a technique developed in this paper, we provide new proofs of the `prototypes' of the first and the third our results.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Yu. Shaprynskii. 2010-09-10. Modular and lower-modular elements of lattices of semigroup varieties. https://arxiv.org/abs/1009.1929

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