SearcharxivSearch

arXiv · 2402.12386

On the semigroup of monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ with a two-element family $\mathscr{F}$ of inductive nonempty subsets of $\omega$

Abstract

We study the semigroup of non-injective monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ with a two-elements family $\mathscr{F}$ of inductive nonempty subsets of $\omega$. We describe the structure of elements of the semigroup $\boldsymbol{End}^*_0(\boldsymbol{B}_{\omega}^{\mathscr{F}})$ of non-injective monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$. In particular we show that its subsemigroup $\boldsymbol{End}^*(\boldsymbol{B}_{\omega}^{\mathscr{F}})$ of non-injective non-annihilating monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ is isomorphic to the direct product of the two-element left-zero semigroup and the multiplicative semigroup of positive integers and describe Green's relations on $\boldsymbol{End}^*(\boldsymbol{B}_{\omega}^{\mathscr{F}})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Oleg Gutik, Inna Pozdniakova. 2024-02-06. On the semigroup of monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ with a two-element family $\mathscr{F}$ of inductive nonempty subsets of $\omega$. https://doi.org/10.30970/vmm.2023.95.014-027

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