SearcharxivSearch

arXiv · 2408.10209

El monoide de endomorfismos de $G$-conjuntos: estructuras y otras propiedades algebraicas

Abstract

Given the action of a group $G$ on a set $X$, an endomorphism of $X$ is a function $f:X \rightarrow X$ which is $G$-equivariant, that is, it commutes with the action, i.e., $f(g\cdot x)= g\cdot f(x)$, for all $x\in X$. The set of endomorphisms of a $G$-set $X$ is a monoid, with the composition of functions , which we will denote $\mathrm{End}_{G}(X)$. Given subsets $U,N\subseteq M$, we say that $U$ generates $M$ modulo $N$ if it is satisfied that $M= \langle U \cup N \rangle$. The relative rank of M modulo N is the minimum cardinality of a set $U$ to generate $M$ modulo $N$. In this work we address the particular case in which $G$ and $X$ are finite to calculate the relative rank of the endomorphism monoid $\mathrm{End}_{G}(X)$ modulo its group of units, denoted by $\mathrm{Aut}_{G}(X)$. We also address structure situations, such as isomorphisms of $\mathrm{Aut}_{G}(X)$ and $\mathrm{End}_{G}(X)$ with other known structures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramón H. Ruiz-Medina. 2024-07-12. El monoide de endomorfismos de $G$-conjuntos: estructuras y otras propiedades algebraicas. https://arxiv.org/abs/2408.10209

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