SearcharxivSearch

arXiv · 2607.11161

Group action-stabilizer graph of group actions of a group on a set

Abstract

In this paper we introduce the group action-stabilizer graph $GAS(G)$ of a group $G$ on a set $X$ with vertex set as the collection of all the group actions of $G$ on $X$, and any two vertices $\phi$ and $\psi$ are adjacent if and only if the non-trivial subgroups $\cap G_x^\phi$ and $\cap G_x^\psi$ of $G$ intersect non-trivially, where $G_x^\phi$ and $G_x^\psi$ are two stabilizers of $x$ with respect to the actions $\phi$ and $\psi$, respectively. We characterize a special subgraph $gas(G)$ of $GAS(G)$ in which the vertex set contains the actions $\phi$ of $G$ on $X$ such that $\cap G_x^\phi$'s are distinct. We determine the number of group actions within some specific groups and find certain conditions under which $GAS(G)$ is equal to $gas(G)$. We also examine the conditions under which $gas(G)$ and its complement are derived graph for a finite nilpotent group $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Nepur Ranjan Hazarika, Kukil Kalpa Rajkhowa. 2026-07-13. Group action-stabilizer graph of group actions of a group on a set. https://arxiv.org/abs/2607.11161

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