SearcharxivSearch

arXiv · 2511.20861

Sylow subgroups and the number of irreducible characters of degrees divisible by a prime $p$

Abstract

Let $G$ be a finite group and $p$ a prime. We establish an upper bound for the derived length of a Sylow $p$-subgroup of $G$ in terms of the number of irreducible characters of $G$ whose degrees are divisible by $p$. We also prove that if $B$ is a $p$-block of a finite $p$-solvable group $G$ with defect group $D$, then the derived length of $D$ is at most one more than the number of ordinary irreducible characters of positive height in $B$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James P. Cossey, Mark L. Lewis, A. A. Schaeffer Fry, Hung P. Tong-Viet. 2025-11-25. Sylow subgroups and the number of irreducible characters of degrees divisible by a prime $p$. https://arxiv.org/abs/2511.20861

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