Search arXivSearch

arXiv · 2103.06441

Left restriction monoids from left $E$-completions

Abstract

Given a monoid $S$ with $E$ any non-empty subset of its idempotents, we present a novel one-sided version of idempotent completion we call left $E$-completion. In general, the construction yields a one-sided variant of a small category called a constellation by Gould and Hollings. Under certain conditions, this constellation is inductive, meaning that its partial multiplication may be extended to give a left restriction semigroup, a type of unary semigroup whose unary operation models domain. We study the properties of those pairs $S,E$ for which this happens, and characterise those left restriction semigroups that arise as such left $E$-completions of their submonoid of elements having domain $1$. As first applications, we decompose the left restriction semigroup of partial functions on the set $X$ and the right restriction semigroup of left total partitions on $X$ as left and right $E$-completions respectively of the transformation semigroup $T_X$ on $X$, and decompose the left restriction semigroup of binary relations on $X$ under demonic composition as a left $E$-completion of the left-total binary relations. In many cases, including these three examples, the construction embeds in a semigroup Zappa-Sz\'{e}p product.

Explore related subjects

Keep this discovery

BibTeXRIS

Tim Stokes. 2021-03-11. Left restriction monoids from left $E$-completions. https://doi.org/10.1016/j.jalgebra.2022.04.038

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