SearcharxivSearch

arXiv · 1609.09821

On special Rees matrix semigroups over semigroups

Abstract

In this paper we focus on Rees $I\times \Lambda$ matrix semigroups without zero over a semigroup $S$ with $\Lambda\times I$ sandwich matrix $P$, where $I$ is a singleton, $\Lambda$ is the factor semigroup of $S$ modulo the kernel $\theta_S$ of the right regular representation of $S$, and $P$ is a choice function on the collection of all $\theta _S$-classes of $S$. We describe the kernel of the right regular representation of this type of Rees matrix semigroups, and prove embedding theorems on them. Motivated by one of embedding theorems, we show how right commutative right cancellative semigroups can be constructed. We define the concept of a right regular sequence of semigroups, and show that every congruence on an arbitrary semigroup defines such a sequence.

Explore related subjects

Keep this discovery

BibTeXRIS

Attila Nagy, Csaba Tóth. 2016-09-30. On special Rees matrix semigroups over semigroups. https://arxiv.org/abs/1609.09821

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