Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 3 Jul 2025 in math.GR | (2507.03100v1)

Abstract: Let $G$ be a finite group and $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is defined as $\chic(1) =\frac{|G: \ker\chi|}{\chi(1)}$. In a paper by Gao, Wang, and Chen \cite{GWC24}, it was shown that $G$ cannot satisfy the condition that $\gcd(\chi(1),\chic(1))$ is prime for all $\chi\in\Irr(G)#$. We generalize this theorem by solving one of Guohua Qian's unsolved problems on character codegrees. In Qian's survey article \cite{Qiancodegree}, he inquires about the structure of non-solvable finite groups with square-free $\gcd$ instead. In particular, we prove that if $G$ is such that $\gcd(\chi(1),\chic(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.