On the codegrees of strongly monolithic characters of finite groups

DOI10.1017/S0004972724000935MaRDI QIDQ6961799zbMATH OpenFDO

Authors Temha Erkoç, Utku Yilmaztürk

Publication date 10 July 2025

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972724000935

zbMATH Keywords

codegreesfinite groupsFitting lengthstrongly monolithic characters

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10)

Review text

Let $x$ be an irreducible character of a finite group $G$. The codegree of $x$ is defined as \N\[[G:\ker x]/x(1).\] \N\NThe authors study the relation between the structure of $G$ and the codegree of a certain subset of the set of irreducible characters of $G$.

Cites work

• Co-degrees of irreducible characters in finite groups.
• scientific article; zbMATH DE number 3526920 (Why is no real title available?)
• On the relations between the structures of finite groups and their strongly monolithic characters
• Solvable groups whose monomial, monolithic characters have prime power codegrees
• SOME CRITERIA FOR SOLVABILITY AND NILPOTENCY OF FINITE GROUPS BY STRONGLY MONOLITHIC CHARACTERS
• The co-degrees of irreducible characters
• The square-free hypothesis on co-degrees of irreducible characters

This page was built for publication: On the codegrees of strongly monolithic characters of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961799)