vix.ing · top · new · best · stats · spec

Counting lifts of Brauer characters

2010/07/18 by James P. Cossey, Mark L. Lewis, Cossey, James P. +1
Computer Science · Engineering · Mathematics · #20c15 #20c20 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.GR #msc:20c15 #msc:20c20

paper · pdf · doi:10.48550/arxiv.1007.3011

A different proof of Theorem 1 is in the paper "The number of lifts of Brauer characters with a normal vertex" by J.P. Cossey, M.L.Lewis, and G. Navarro. Hence, we do not expect to try to publish this note. We feel that the proof in this paper is of independent interest

arxiv created 2010/07/18 · openalex publication_date 2010/07/18 · arxiv updated 2010/07/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we examine the behavior of lifts of Brauer characters in p-solvable groups where p is an odd prime. In the main result, we show that if ϕ∈ IBrp(G) is a Brauer character of a solvable group such that ϕhas an abelian vertex subgroup Q, then the number of lifts of ϕin Irr(G) is at most |Q|. In order to accomplish this, we develop several results about lifts of Brauer characters in p-solvable groups that were previously only known to be true in the case of groups of odd order.

Related