SearcharxivSearch

arXiv · 2507.03100

On groups with square-free gcd of character degree and codegree

Abstract

Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chi^c(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen, it was shown that $G$ cannot satisfy the condition that $\gcd(\chi(1),\chi^c(1))$ is prime for all $\chi\in\text{Irr}(G)^\#$. We generalize this theorem by solving one of Guohua Qian's unsolved problems on character codegrees. Qian inquires about the structure of non-solvable finite groups with square-free $\gcd$ instead. We prove that if $G$ is such that $\gcd(\chi(1),\chi^c(1))$ is square-free for every irreducible character $\chi$, then $G/\text{Sol}(G)$ is isomorphic to one among a particular list of almost simple groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Karam Aldahleh, Alan Kappler, Neil Makur, Yong Yang. 2025-07-03. On groups with square-free gcd of character degree and codegree. https://arxiv.org/abs/2507.03100

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