SearcharxivSearch

arXiv · 2608.27292

Kleisli convolution representations of power monoids

Abstract

We show that power semigroups of groups, and more generally reduced finitary power monoids, arise naturally as convolution monoids in Kleisli categories of powerset monads: (1) for the non-empty powerset monad, the Kleisli Hom-space $\mathrm{Hom}_{\mathbf{Kl}(\mathscr P_+)}(1,G)$ is isomorphic to the power monoid $\mathcal P_+(G)$; (2) for the reduced finite powerset monad on pointed sets, the Kleisli Hom-space $\mathrm{Hom}_{\mathbf{Kl}(\mathscr P_{\mathrm{fin}})}$ $(\mathbb Z/2\mathbb Z,H)$ is isomorphic to the reduced finitary power monoid $\mathcal P_{\mathrm{fin},1}(H)$. This unifies several constructions in power semigroup theory: Kleisli convolution representations of semigroups, base change along surjective group homomorphisms, and rigidity of automorphism groups. As an application, we prove that for every proper numerical monoid $S$, the Kleisli Hom-monoid $\mathrm{Hom}_{\mathbf{Kl}(\mathscr P_{\mathrm{fin}})}(\mathbb Z/2\mathbb Z,S)$ is rigid. This gives a proof of the Tringali--Yan conjecture in the language of Kleisli categories. It should be mentioned that this conjecture was already proved by Bhowmik and Tringali in a preprint posted on arXiv on July 25, 2026.

Explore related subjects

Keep this discovery

BibTeXRIS

Haicun Wen, Jian He, Yu-Zhe Liu. 2026-08-27. Kleisli convolution representations of power monoids. https://arxiv.org/abs/2608.27292

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