SearcharxivSearch

arXiv · 2306.07844

On automorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ in the case when the family $\mathscr{F}$ consists of nonempty inductive subsets of ${\omega}$

Abstract

Let $\mathscr{F}$ be a family of nonempty inductive subsets of ${\omega}$. It is proved that an injective endomorphism $\varepsilon$ of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ is the transformation if and only if $\varepsilon$ has three distinct fixed points, which is equivalent to existence non-idempotent element $(i,j,[p))\in\boldsymbol{B}_{\omega}^{\mathscr{F}}$ such that $(i,j,[p))\varepsilon=(i,j,[p))$.

Explore related subjects

Keep this discovery

BibTeXRIS

Oleg Gutik, Mykola Mykhalenych. 2023-06-13. On automorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ in the case when the family $\mathscr{F}$ consists of nonempty inductive subsets of ${\omega}$. https://arxiv.org/abs/2306.07844

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