2016/09/07 by Mark L. Lewis, Lewis, Mark L.
Computer Science · Engineering · Mathematics · #20C15 #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.1609.02029
openalex publication_date 2016/09/07 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
Let π be a set of primes, and let G be a finite π-separable group. We consider the Isaacs \rm Bπ-characters. We show that if N is a normal subgroup of G, then \rm Bπ(G/N) = \rm Irr (G/N) ∩ \rm Bπ(G).