Finite groups with an irreducible character of large degree
Nguyen Ngoc Hung, Mark L. Lewis, and Amanda A. Schaeffer Fry

TL;DR
This paper establishes a sharp upper bound on the order of finite groups with an irreducible character of large degree, refining previous results and providing a precise mathematical relationship involving the group's order and character degree.
Contribution
The authors prove a new optimal bound on the order of finite groups based on the degree of an irreducible character, improving earlier bounds and demonstrating its sharpness.
Findings
The bound |G| ≤ e^4 - e^3 is proven to be best possible.
The result generalizes and strengthens previous inequalities relating group order and character degrees.
The bound applies for all e > 1, providing a precise measure of the group's size.
Abstract
Let be a finite group and the degree of a complex irreducible character of , then write where is a nonnegative integer. We prove that whenever . This bound is best possible and improves on several earlier related results.
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 · graph theory and CDMA systems
