SearcharxivSearch

arXiv · 2002.04072

Finite Coverings of Semigroups and Related Structures

Abstract

For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously defined covering numbers of inverse semigroups and monoids. Our three main theorems give a complete description of the covering number of finite semigroups, finite inverse semigroups, and monoids (modulo groups and infinite semigroups). For a finite semigroup that is neither monogenic nor a group, its covering number is two. For all $n\geq 2$, there exists an inverse semigroup with covering number $n$, similar to the case of loops. Finally, a monoid that is neither a group nor a semigroup with an identity adjoined has covering number two as well.

Explore related subjects

Keep this discovery

BibTeXRIS

Casey Donoven, Luise-Charlotte Kappe. 2020-02-10. Finite Coverings of Semigroups and Related Structures. https://arxiv.org/abs/2002.04072

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