Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.09966

Pseudovarieties of ordered completely regular semigroups

Jorge Almeida·Ondřej Klíma
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an order compatible with the semigroup operation. In the case of unions of groups, so-called completely regular semigroups, the problem of which new pseudovarieties appear in the ordered context is solved. As applications, it is shown that the lattice of pseudovarieties of ordered completely regular semigroups is modular and that taking the intersection with the pseudovariety of bands defines a complete endomorphism of the lattice of all pseudovarieties of ordered semigroups.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Jorge Almeida, Ondřej Klíma. 2018-10-23. Pseudovarieties of ordered completely regular semigroups. https://doi.org/10.1007/s00025-019-0998-7

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗