SearcharxivSearch

arXiv · 2301.09944

Set-theoretical solutions of the pentagon equation on Clifford semigroups

Abstract

Given a set-theoretical solution of the pentagon equation $s:S\times S\to S\times S$ on a set $S$ and writing $s(a, b)=(a\cdot b,\, \theta_a(b))$, with $\cdot$ a binary operation on $S$ and $\theta_a$ a map from $S$ into itself, for every $a\in S$, one naturally obtains that $\left(S,\,\cdot\right)$ is a semigroup. In this paper, we focus on solutions on Clifford semigroups $\left(S,\,\cdot\right)$ satisfying special properties on the set of the idempotents $E(S)$. Into the specific, we provide a complete description of idempotent-invariant solutions, namely, those solutions for which $\theta_a$ remains invariant in $E(S)$, for every $a\in S$. Moreover, considering $(S,\,\cdot)$ as a disjoint union of groups, we construct a family of idempotent-fixed solutions, i.e., those solutions for which $\theta_a$ fixes every element in $E(S)$, for every $a\in S$, starting from a solution on each group.

Explore related subjects

Keep this discovery

BibTeXRIS

Marzia Mazzotta, Vicent Pérez-Calabuig, Paola Stefanelli. 2023-01-24. Set-theoretical solutions of the pentagon equation on Clifford semigroups. https://doi.org/10.1007/s00233-024-10421-1

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