SearcharxivSearch

arXiv · 2512.07073

A new generalization of the McKay conjecture for $p$-solvable groups

Abstract

Let $P$ be a Sylow $p$-subgroup of a finite $p$-solvable group $G$, where $p$ is a prime. Using a normal $p$-series $\mathcal{N}$ of $G$, we introduce the notion of $(\mathcal{N},p)$-stable characters and prove that $G$ and ${\bf N}_G(P)$ have equal numbers of such characters, which gives a new generalization of the McKay conjecture for $p$-solvable groups. Also, we establish a canonical bijection between these characters in the case where $G$ has odd order. Our proofs depend heavily on the theory of self-stabilizing pairs founded by M. L. Lewis, as well as some results of $\pi$-special characters due to I. M. Isaacs.

Explore related subjects

Keep this discovery

BibTeXRIS

Huimin Chang, Ping Jin. 2025-12-08. A new generalization of the McKay conjecture for $p$-solvable groups. https://arxiv.org/abs/2512.07073

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