SearcharxivSearch

arXiv · 2407.05939

Special cases on the relative rank of G-equivariant functions over an infinite G-set

Abstract

Given the action of a group $G$ on a set $ X $ , the set of $ G $ -equivariant functions, those that commute with the action, i.e., $ f(g \cdot x) = g \cdot f(x) $ for all $ x \in X $ , $ g \in G $ , forms a monoid under function composition. It is known that when a finite group $ G $ acts on a finite set $ X $ , a finite number of elements in this monoid are sufficient to generate it along with its group of units. The minimum number of elements required to generate the monoid is called the relative rank. This paper presents two particular cases where $ G $ is a finite group, $ X $ is an infinite set, and the relative rank of the monoid of $ G $ -equivariant functions is finite; moreover, we compute it.

Explore related subjects

Keep this discovery

BibTeXRIS

Ramón H Ruiz-Medina. 2024-06-22. Special cases on the relative rank of G-equivariant functions over an infinite G-set. https://arxiv.org/abs/2407.05939

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