SearcharxivSearch

arXiv · 1305.5427

Notes on a problem on weakly exponential $Δ$-semigroups

Abstract

A semigroup $S$ is called a weakly exponential semigroup if, for every couple $(a,b)\in S\times S$ and every positive integer $n$, there is a non-negative integer $m$ such that $(ab)^{n+m}=a^nb^n(ab)^m=(ab)^ma^nb^n$. A semigroup $S$ is called a $Δ$-semigroup if the lattice of all congruences of $S$ is a chain with respect to inclusion. The weakly exponential $Δ$-semigroups were described in [5]: A. Nagy, Weakly exponential $Δ$-semigroups, Semigroup Forum, 40(1990), 297-313. Although the existence of two types of them (T2R and T2L semigroups) is an open question, Theorem 3.11 of [5] gives necessary and sufficient conditions for a semigroup to be a T2R [T2L] semigroup. In our present paper we give a little correction of condition (v) of Theorem 3.11 of [5], and prove some new results which are addendum to the problem: Doest there exist a T2R [T2L] semigroup?

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Attila Nagy. 2015-08-29. Notes on a problem on weakly exponential $Δ$-semigroups. https://doi.org/10.12988/ija.2013.31094

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