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

Abstract

Let G be a finite group and be an irreducible character of G. The codegree of is defined as c(1) =|G: |(1). In a paper by Gao, Wang, and Chen, it was shown that G cannot satisfy the condition that ((1),c(1)) is prime for all ∈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 instead. We prove that if G is such that ((1),c(1)) is square-free for every irreducible character , then G/Sol(G) is isomorphic to one among a particular list of almost simple groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…