SearcharxivSearch

arXiv · 2107.14075

On the semigroup generating by extended bicyclic semigroup and a $\omega$-closed family

Abstract

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ is a combinatorial inverse semigroup. Green's relations, the natural partial order on the semigroup $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ and its set of idempotents are described. The criteria of simplicity, $0$-simplicity, bisimplicity, $0$-bisimplicity of the semigroup $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ and the criterion for $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ to be isomorphic to the extended bicyclic semigroup or the countable semigroup of matrix units are derived. It is proved that in the case when the family $\mathscr{F}$ consists of all singletons of $\omega$ and the empty set, the semigroup $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ is isomorphic to the Brandt $\lambda$-extension of the semilattice $(\omega,\min)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Oleg Gutik, Inna Pozdnyakova. 2021-07-29. On the semigroup generating by extended bicyclic semigroup and a $\omega$-closed family. https://arxiv.org/abs/2107.14075

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