Inducing π-partial characters with a given vertex
Abstract
Let G be a solvable group. Let p be a prime and let Q be a p-subgroup of a subgroup V. Suppose φ ∈ G. If either |G| is odd or p = 2, we prove that the number of Brauer characters of H inducing φ with vertex Q is at most | GQ: VQ|.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.