Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.03772

Cardinalities in finite monoids of $G$-equivariant functions

Ramón H. Ruiz-Medina
View original source ↗Read source document ↗Export metadata ↓

Abstract

A set with a group action is referred to as a $G$-set, and the set of functions that commute with this action forms a monoid under function composition. This paper examines the case where the $G$-set is finite, which implies that the monoid of $G$-equivariant functions is also finite. The document provides formulas for calculating the cardinality of this monoid, its group of units, and explores special cases of $G$-equivariant functions, known as fixing elementary collapsings. All of these results are expressed in terms of specific properties of the $G$-set, including the number of orbits and certain indices of the subgroups acting as stabilizers.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Ramón H. Ruiz-Medina. 2025-03-04. Cardinalities in finite monoids of $G$-equivariant functions. https://arxiv.org/abs/2503.03772

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗