SearcharxivSearch

arXiv · 2607.04053

Finite generating sets for monoids of $G$-equivariant functions

Abstract

Given the action of a group $G$ on a set $X$, the set of all $G$-equivariant functions, i.e., those satisfying $f(g\cdot x)=g\cdot f(x)$ for all $g\in G$ and $x\in X$, forms a monoid under composition. In this work we study their generating sets. First, we propose bounds for the cardinalities of the generating sets of their group of units, denoted by $\operatorname{Aut}_{G}(X)$. Subsequently, using so-called orbital infiltrations, certain transformations that turn out to be indispensable and provide relevant structural information about the monoid, we determine conditions on the group $G$, the set $X$, and the action that prevent the whole monoid $\operatorname{End}_{G}(X)$ from admitting a finite generating set.

Explore related subjects

Keep this discovery

BibTeXRIS

Ramón H. Ruiz-Medina, Victor M. Lara-Gómez, Gerardo Romero-Rosales. 2026-07-04. Finite generating sets for monoids of $G$-equivariant functions. https://arxiv.org/abs/2607.04053

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