SearcharxivSearch

arXiv · math/0605698

On conjugacy in regular epigroups

Abstract

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case when $S$ is a monoid, denote by $G$ the group of units of $S$. Then the relation of $G$-conjugacy is defined by $a\sim_G b \iff a=g^{-1}bg$ for certain $g\in G$. We establish the structure of conjugacy classes for regular epigroups (i.e. semigroups such that some power of each element lies in a subgroup). As a corollary we obtain a criterion of conjugacy in terms of $G$-conjugacy for factorizable inverse epigroups. We show that our general conjugacy criteria easily lead to known and new conjugacy criteria for some specific semigroups, among which are the full transformation semigroup and the full inverse symmetric semigroup over a finite set, the linear analogues of these semigroups and the semigroup of finitary partial automatic transformations over a finite alphabet.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ganna Kudryavtseva. 2006-05-27. On conjugacy in regular epigroups. https://arxiv.org/abs/math/0605698

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