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 · x) = g · f(x) for all x ∈ X , g ∈ 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…