27 research outputs found

    Bounds on the number of lifts of a Brauer character in a p-solvable group

    Get PDF
    The Fong-Swan theorem shows that for a pp-solvable group GG and Brauer character \phi \in \ibrg, there is an ordinary character \chi \in \irrg such that χ0=ϕ\chi^0 = \phi, where 0^0 denotes restriction to the pp-regular elements of GG. This still holds in the generality of π\pi-separable groups \cite{bpi}, where \ibrg is replaced by \ipig. For \phi \in \ipig, let L_{\phi} = \{\chi \in \irrg \mid \chi^0 = \phi \}. In this paper we give a lower bound for the size of LϕL_{\phi} in terms of the structure of the normal nucleus of ϕ\phi and, if GG is assumed to be odd and π={p′}\pi = \{p' \}, we give an upper bound for LϕL_{\phi} in terms of the vertex subgroup for ϕ\phi

    Lifts and vertex pairs in solvable groups

    Full text link
    Suppose GG is a pp-solvable group, where pp is odd. We explore the connection between lifts of Brauer characters of GG and certain local objects in GG, called vertex pairs. We show that if χ\chi is a lift, then the vertex pairs of χ\chi form a single conjugacy class. We use this to prove a sufficient condition for a given pair to be a vertex pair of a lift and to study the behavior of lifts with respect to normal subgroups

    Counting lifts of Brauer characters

    Full text link
    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 \phi \in IBrp(G) is a Brauer character of a solvable group such that \phi has an abelian vertex subgroup Q, then the number of lifts of \phi 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.Comment: 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 interes

    Controlling composition factors of a finite group by its character degree ratio

    Full text link
    For a finite nonabelian group GG let \rat(G) be the largest ratio of degrees of two nonlinear irreducible characters of GG. We show that nonabelian composition factors of GG are controlled by \rat(G) in some sense. Specifically, if SS different from the simple linear groups \PSL_2(q) is a nonabelian composition factor of GG, then the order of SS and the number of composition factors of GG isomorphic to SS are both bounded in terms of \rat(G). Furthermore, when the groups \PSL_2(q) are not composition factors of GG, we prove that |G:\Oinfty(G)|\leq \rat(G)^{21} where \Oinfty(G) denotes the solvable radical of GG.Comment: 16 pages, 1 tabl

    On a conjecture of Gluck

    Full text link
    Let F(G)F(G) and b(G)b(G) respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group GG. A well-known conjecture of D. Gluck claims that if GG is solvable then ∣G:F(G)∣≤b(G)2|G:F(G)|\leq b(G)^{2}. We confirm this conjecture in the case where ∣F(G)∣|F(G)| is coprime to 6. We also extend the problem to arbitrary finite groups and prove several results showing that the largest irreducible character degree of a finite group strongly controls the group structure.Comment: 16 page

    On a conjecture of Gluck

    Get PDF

    Research Statement

    No full text
    My primary area of research is the representation theory of finite groups. The main focus of my work is the representation theory of solvable groups, and especially the interplay between the representations of a group over a field of characteristic zero and the representations over a field with positive characteristic. In addition, I am interested in th
    corecore