SearcharxivSearch

arXiv · 2108.09543

On group congruences on the semigroup $\boldsymbol{B}_ω^{\mathscr{F}}$ and its homomorphic retracts in the case when a family $\mathscr{F}$ consists of inductive non-empty subsets of $ω$

Abstract

We study group congruences on the semigroup $\boldsymbol{B}_ω^{\mathscr{F}}$ and its homomorphic retracts in the case when an $ω$-closed family $\mathscr{F}$ which consists of inductive non-empty subsets of $ω$. It is proven that a congruence $\mathfrak{C}$ on $\boldsymbol{B}_ω^{\mathscr{F}}$ is a group congruence if and only if its restriction on a subsemigroup of $\boldsymbol{B}_ω^{\mathscr{F}}$, which is isomorphic to the bicyclic semigroup, is not the identity relation. Also, all non-trivial homomorphic retracts and isomorphisms of the semigroup $\boldsymbol{B}_ω^{\mathscr{F}}$ are described.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oleg Gutik, Mykola Mykhalenych. 2021-09-03. On group congruences on the semigroup $\boldsymbol{B}_ω^{\mathscr{F}}$ and its homomorphic retracts in the case when a family $\mathscr{F}$ consists of inductive non-empty subsets of $ω$. https://arxiv.org/abs/2108.09543

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