SearcharxivSearch

arXiv · 2506.18837

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

Abstract

We study the semigroup $\overline{\boldsymbol{End}}(\boldsymbol{B}_{\omega}^{\mathscr{F}^2})$ of all endomorphisms of the bicyclic extension $\boldsymbol{B}_{\omega}^{\mathscr{F}^2}$ with the two-element family $\mathscr{F}^2$ of inductive nonempty subsets of $\omega$. The submonoid $\left\langle\varpi\right\rangle^1$ of $\overline{\boldsymbol{End}}(\boldsymbol{B}_{\omega}^{\mathscr{F}^2})$ with the property that every element of the semigroup $\overline{\boldsymbol{End}}(\boldsymbol{B}_{\omega}^{\mathscr{F}^2})$ has the unique representation as the product of the monoid endomorphism of $\boldsymbol{B}_{\omega}^{\mathscr{F}^2}$ and the element of $\left\langle\varpi\right\rangle^1$ is constructed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oleg Gutik, Marko Serivka. 2025-06-17. On the semigroup of endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}^2}$ with the two-element family $\mathscr{F}^2$ of inductive nonempty subsets of $\omega$. https://doi.org/10.24144/2616-7700.2025.47(2).43-51

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