SearcharxivSearch

arXiv · 1504.07181

Remarks on the paper "M. Kolibiar, On a construction of semigroups"

Abstract

In his paper "On a construction of semigroups", M. Kolibiar gives a construction for a semigroup $T$ (beginning from a semigroup $S$) which is said to be derived from the semigroup $S$ by a $θ$-construction. He asserted that every semigroup $T$ can be derived from the factor semigroup $T/θ(T)$ by a $θ$-construction, where $θ(T)$ is the congruence on $T$ defined by: $(a, b)\in θ(T)$ if and only if $xa=xb$ for all $x\in T$. Unfortunately, the paper contains some incorrect part. In our present paper we give a revision of the paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Attila Nagy. 2016-01-29. Remarks on the paper "M. Kolibiar, On a construction of semigroups". https://doi.org/10.1007/s10998-015-0094-z

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