Character degrees of normally monomial p-groups of maximal class

2022/09/12 by Dongfang Yang, Yang, Dongfang, Heng Lv +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2209.05021

openalex publication_date 2022/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A finite group G is normally ~monomial if all its irreducible characters are induced from linear characters of normal subgroups of G. 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 p-groups of maximal class in terms of p.

Related

• Character degrees of some p-groups
• On super-monomial characters and groups having two irreducible monomial character degrees
• Characters of p'-degree and Thompson's character degree theorem
• Character codegrees of maximal class p-groups
• On The Largest Character Degree And Solvable Subgroups Of Finite Groups