On permutation characters of finite group

Abstract

Let G be a finite group and \( M \) be a maximal subgroup of \( G \). We call every irreducible constituent \( \) of \( (1M)G \) a \( P \)-character of \( G \) with respect to \( M \). In this paper, we prove that all P-characters of G are monomial if and only if G is solvable, which solves a question posed by Qian and Yang.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…