SearcharxivSearch

arXiv · 2503.14511

Green relations over finite monoids of $G$-equivariant functions

Abstract

For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition. The Green Relations are powerful tools to comprehend the structure of a semigroup. We study the case where $X$ is a finite set and compute the green relations for its monoid of $G$-equivariant functions, attempting to describe them based on some particular elements in the monoid called elementary collapsings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramon H- Ruiz-Medina, Victor M. Lara-Gómez. 2025-03-10. Green relations over finite monoids of $G$-equivariant functions. https://arxiv.org/abs/2503.14511

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