Character degrees of normally monomial p-groups of maximal class
Dongfang Yang, Heng Lv

TL;DR
This paper characterizes the possible irreducible character degrees of normally monomial p-groups of maximal class, providing explicit sets and bounds for these degrees, which advances understanding of their representation theory.
Contribution
It determines all possible irreducible character degree sets for normally monomial 5-groups of maximal class and establishes an upper bound for the largest degree in such p-groups.
Findings
Complete classification of degree sets for normally monomial 5-groups of maximal class
Upper bound for the largest irreducible character degree in normally monomial p-groups of maximal class
Enhanced understanding of the representation structure of these p-groups
Abstract
A finite group is if all its irreducible characters are induced from linear characters of normal subgroups of . In this paper, we determine all possible irreducible character degree sets of normally monomial 5-groups of maximal class. Moreover, we give an upper bound for the largest irreducible character degree of normally monomial -groups of maximal class in terms 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 · graph theory and CDMA systems · Coding theory and cryptography
