Finite groups with some bounded codegrees
Dongfang Yang, Yu Zeng, Heng Lv

TL;DR
This paper establishes a solvability criterion for finite groups based on the minimum ratio of the square of irreducible character degrees to their codegrees, linking character theory to group structure.
Contribution
It introduces a new solvability criterion for finite groups using bounds on character codegrees and degrees, advancing understanding of group structure via character ratios.
Findings
Provides a criterion for solvability based on character ratios.
Connects character codegrees with group solvability.
Offers new insights into the structure of finite groups.
Abstract
For a character of a finite group , the number cod is called the codegree of .In this paper, we give a solvability criterion for a finite group depending on the minimum of the ratio , when varies among the irreducible characters of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography
