Skip to main content
Article Publicly Available

Nonsolvable groups with few primitive character degrees

  • EMAIL logo
Published/Copyright: November 14, 2017

Abstract

We study the finite nonsolvable groups in which all nonlinear primitive (or nonmonomial) characters are of the same degree, or of square-free, prime power, or odd degree.

1 Introduction

In this paper, G always denotes a finite group, all characters are complex characters, and we use Isaacs [12] as a source for standard notation and results from character theory. An irreducible character of G is called monomial if it is induced from a linear character of a subgroup of G, and if all irreducible characters of G are monomial, then G is called an M-group. A well-known theorem of Taketa states that M-groups are solvable. There are many generalizations on the solvability of M-groups, see [1], [2], [3, Chapter 14], [13], [14] and [17]. If an irreducible character of a finite group cannot be induced from any character of any proper subgroup, then the character is called primitive. Clearly, all linear characters are both monomial and primitive, and a nonlinear primitive character is nonmonomial. In this paper, we will investigate the finite nonsolvable groups with “few” primitive or nonmonomial character degrees, and then we show in some sense that a nonsolvable group possesses “many” primitive or nonmonomial characters.

Recall that if all nonlinear irreducible characters of a group have the same degree, or have odd degree, then, as is well-known, the group is solvable. We also note that the nonsolvable groups in which all nonlinear irreducible characters are of square-free degree or of prime power degree have been studied, see [11, Theorem 2.8] and [15, Theorem 4.1].

Throughout, p is always a prime, q=pf is a prime power, and Sol(G) denotes the largest normal solvable subgroup of G. By a primitive, imprimitive, monomial or nonmonomial character, we always mean an irreducible one.

Theorem A1.

Let G be a nonsolvable group and assume that all nonlinear primitive characters of G are of the same degree, say d. Then there exists a chief factor N/Sol(G) of G satisfying the following conditions:

  1. G/N is solvable,

  2. N/Sol(G) is a direct product of t copies of L2(q), where q=pf4,

  3. d=4t if q=4,5, d=6t if q=7, and d=qt if q8.

Theorem A2 ([17]).

Assume that all nonmonomial characters of G are of the same degree. Then G is solvable.

Theorem B1.

Let G be a nonsolvable group and assume that all primitive characters of G are of square-free degree. Then G/Sol(G) is isomorphic to one of the following groups: A7, S7, L2(p) or PGL2(p), where p7 is a prime, p-1 is square-free.

Theorem B2.

Let G be a nonsolvable group and assume that all nonmonomial characters of G are of square-free degree. Then G/Sol(G) is isomorphic to A7, L2(p) or PGL2(p), where p7 is a prime, p-1 is square-free.

Theorem C1.

Let G be a nonsolvable group and assume that all primitive characters of G are of prime power degree. Let K1,,Ks be all the nonabelian composition factors of G. Then there is a prime p such that for all i, KiL2(pfi), where pfi=4 or 8.

Theorem C2.

Let G be a nonsolvable group and assume that all nonmonomial characters of G are of prime power degree. Then G/Sol(G) is one of the following types:

  1. L2(9)G/Sol(G)Aut(L2(9)),

  2. L2(p), where p=1+2k is a prime,

  3. S5,

  4. L2(2f), where 2f-1 is a prime.

Theorem D1.

Assume that all primitive characters of G are of odd degree. Then every nonabelian composition factor of G is of type L2(q), where q is odd and q=pf9.

Theorem D2.

Assume that all nonmonomial characters of G are of odd degree. Then G is solvable.

In order to prove the theorems, we have to investigate the case when G possesses a minimal normal subgroup N satisfying the following hypothesis.

Hypothesis 1.1.

Let Ω={S1,,St}, where S1,,St are isomorphic to a nonabelian simple group S. Assume that N is a minimal normal subgroup of G and that

(D)N=S1××St,t1.

Let G and N satisfy Hypothesis 1.1, and let 1NθIrr(N), χIrr(G|θ). The following example tells us that if θ is primitive, then χ may be monomial, and that if θ is monomial, then χ may be primitive.

Let NG, where GS5 and NA5.

(a) Let θ1Irr(N) be of degree 3 and let χ1Irr(G|θ1). Then θ1 is primitive, χ1 is an monomial character of degree 6. Indeed, χ1 is induced from a linear character of a subgroup of order 20.

(b) Let θ2Irr(N) be of degree 5 and let χ2Irr(G|θ2). Then θ2 is monomial, and χ2 is a primitive character of degree 5.

2 Maximal subgroup

In this section, we investigate the maximal subgroup H of G with HN=G, where G and N satisfy Hypothesis 1.1. Note that Lemma 2.2 is known, we restate its easy proof for the reader’s convenience.

Lemma 2.1 ([2, Lemma 2]).

Let N=S1××St be a direct product of isomorphic nonabelian simple groups, and let M be a maximal subgroup of N with S1M. Then one of the following assertions holds:

  1. M=D×S2××St, where D is maximal in S1.

  2. If one of the subgroups S2,,St, say S2, is not contained in M, then

    M=D×S3××St,

    where DS1=DS2=1 and S1S2D<S1×S2.

Lemma 2.2.

Assume that Si are nonabelian simple groups and N=S1××Sm is normal in G. Then N can be written as a direct product of some minimal G-invariant subgroups, and each of which is a direct product of some members of {Si:1im}.

Proof.

Let L be a minimal G-invariant subgroup of N. Since every composition factor of L is nonabelian by the Jordan–Hölder theorem, we have Z(L)=1. Without loss of generality, we may assume that S1L==SkL=1, km, and that SjL>1 for all j>k. Since Sj and L are normal in N, the simplicity of Sj implies that SjL for all j>k. Observe that S1××SkCN(L) and CN(L)L=Z(L)=1. We have N=L×CN(L), where L=Sk+1××Sm and CN(L)=S1××Sk. As CN(L) is also normal in G, by induction we get the required result. ∎

Let Ω={E1,,Em} be a set of groups. Assume that a group E has the decomposition

(D1)E=E1××Em.

Clearly every element e of E can be written as e=1imei, where eiEi. We call ei the ith component of e under the decomposition (D1). The length of eE, denoted by lD1(e) or lΩ(e), is the number of nonidentity components of e. For a subgroup H of E, let Hi be the set of ith components of h under the decomposition (D1), where h runs over H. It is easy to see that HiEi for all i, but Hi is not necessarily a subgroup of H.

Lemma 2.3.

Let Ω={S1,,St}, where Si are isomorphic to a nonabelian simple group S. Let

(D2)N=S1××St

and HN. Assume that for every i=1,,t, Si is equal to the ith component Hi of H under the decomposition (D2). Then H and N can be written as

H=A1××Ak,N=B1××Bk,1kt,

where every Bj is a direct product of rj members of Ω with 1jkrj=t, SAjBj, and lΩ(aj)=rj for every nonidentity ajAj.

Proof.

Working by induction on t, we may assume that HE for some maximal subgroup E of N. Since Hi=Si for all i, by Lemma 2.1 we may assume that

(D3)E=E1××Et-2×Et-1,

where Ej=Sj for all jt-2 and one has that SEt-1<St-1×St with Et-1St-1=Et-1St=1. In particular, E is a direct product of t-1 copies of S. Set Δ={E1,,Et-1}. For every hH, write

h={1jthj,where hjSj,1jt-1ej,where ejEj.

Then ej=hj for all jt-2, and et-1=ht-1ht. Let Hj be the jth component of H under the decomposition (D3). Clearly we have Hj=Ej=Sj if jt-2. Observe that Ht-1Et-1 and that

|Ht-1|=|{ht-1ht:hH}||{ht-1:hH}|=|Ht-1|=|S|=|Et-1|.

We have Ht-1=Et-1. By induction, we may write

H=A1××Ak,E=C1××Ck,

where Cj is a direct product of rj members of Δ, SAjCj, and lΔ(aj)=rj for all 1ajAj. Without loss of generality, we may assume that

Ck=U×Et-1,

where U is a direct product of (rk-1) members of Δ-{Et-1}. Now we obtain N=B1××Bk, where Bk=U×St-1×St, and Bj=Cj for all jk-1. Clearly Bk is a direct product of (rk+1) members of Ω, and

lΩ(ak)=lΔ(ak)+1=rk+1

for all 1akAk. The result follows.∎

Lemma 2.4.

Let G and N satisfy Hypothesis 1.1 and assume that H is a maximal subgroup of G such that G=HN. Set K=HN. Then one of the following holds:

  1. K=K1××Kt, where Ki<Si for all i, and H acts transitively on the set {K1,,Kt}.

  2. K=A1××Ak is minimal normal in H, where A1AkS, kt, k<t, and every nonidentity element of Ai has length t/k under the decomposition ((D)).

Proof.

Clearly KH and K<N. Let Ki be the ith component of K under the decomposition (D). Clearly G=HN and G acts transitively on Ω, thus H acts transitively on Ω. We claim that K1 and Ki are H-conjugate. Since S1a=Si for some aH, we have K1aS1a=Si. Note that if k1aSi and k1 is the first component of an element kK, then k1a is the ith component of kaK. This implies that K1aKi. Similarly, we have KiK1b for some bH. Hence |K1|=|Ki| and the claim follows. Now we see that H acts transitively on {K1,,Kt}. In particular, K1××Kt is H-invariant.

Assume that Ki<Si for all i. Let Δ=K1××Kt. It is easy to see that Δ<N, KΔ, and HΔG because Δ is H-invariant. Since

HΔN=Δ(HN)=Δ<N,

we get by the maximality of H that ΔH. Therefore Δ=K, and (1) follows.

Assume that Ki=Si for some i. Then Ki=Si for all i because H acts transitively on {K1,,Kt}. By Lemma 2.3, we may write K=A1××Ak and N=B1××Bk, where every Bj is a direct product of rj members of Ω, SAjBj, and lΩ(aj)=rj for all nonidentity ajAj. Let Ωi be the set of direct simple factors of Bi. Then |Ωi|=ri, where 1ikri=t. Note that if 1aiAi, then

lΩ(ai)=lΩi(ai)=ri,

where lΩi(ai) is the length of ai under the decomposition of Bi. Assume that r:=r1=min{ri:i=1,,k}. Let 1a1A1. Since H acts transitively on Ω and K=A1××Ak, for each ik, there exist yiH and 1a1iAi such that a1yi=1jka1j, where a1jAj. Clearly

r1=lΩ1(a1)=lΩ(a1)=lΩ(a1yi)=1jklΩj(a1j)lΩi(a1i)=ri.

It follows that

r1==rk=r,

and that

a1yiAi.

Since A1yi and Ai are simple and normal in K, we have A1yi=Ai. This implies that H acts transitively on {A1,,Ak}, and so K is minimal normal in H. Since t=1ikri=rk and K<N, we get that k<t, kt, and (2) follows.∎

3 Reduction to almost simple groups

Let Pri(G) be the set of primitive characters of G. Assume that S is a nonabelian simple group and SG. Let Priext(S) be the set of primitive characters of S that are extendible to Aut(S), and Priext(G)(S) the set of primitive characters of S that are extendible to NG(S). Note that if θIrr(S) is extendible to Aut(S), then θ extends to NG(S) because SCG(S)=S×CG(S) and NG(S)/CG(S)Aut(S). Thus

Priext(S)Priext(G)(S)Pri(S).

Assume that G and N satisfy Hypothesis 1.1 and let σIrr(N). Then one has σ=1itσi, where σiIrr(Si). We call σi the ith component of σ in N.

Assume that G and N satisfy Hypothesis 1.1 and let σ1Irr(S1). Then one has σ1^:=σ1×1S2××StIrr(N). Clearly the stabilizer of σ1^ in G is a subgroup of NG(S1) because G acts transitively on {S1,,St}. For the case when σ1^ (or σ1) is NG(S1)-invariant, clearly the G-orbit {σ1^x:xG} has size |G:NG(S1)|=t and we denote by σ1G^, the product of all distinct G-conjugates of σ1^.

Lemma 3.1 ([4, Lemma 5]).

Let G and N satisfy Hypothesis 1.1, and assume that σIrr(S1) extends to NG(S1). Then σG^ extends to G.

Proof.

Note that in the original version of [4, Lemma 5], σ is assumed to be extendible to Aut(S1). Repeating its proof, we get the result. ∎

Definition 3.2.

An irreducible character χ of G is called to be super-primitive, provided that for every H<G and for every ψIrr(H), ψG does not equal a multiple of χ.

Clearly super-primitive characters are primitive. For solvable groups, it is shown in [9] that all primitive characters are necessarily super-primitive. For every nonabelian simple group S, as shown in [14], S possesses at least one super-primitive character. We do not apply the full strength of the mentioned result in [14]. Actually, we mainly use the super-primitivity of the Steinberg character of L2(q), where q=4 or q8. Under Hypothesis 1.1 with t2, using super-primitive characters, we can find “many” primitive or nonmonomial characters of G. This enables us to reduce the case to almost simple group.

Proposition 3.3.

Let G and N satisfy Hypothesis 1.1, and let θIrr(N) be such that the first component σ1 of θ is primitive. Assume that χIrr(G|θ) is induced from a character of a proper subgroup H of G. Then HN<G whenever the following conditions hold:

  1. If τ1 is the first component of some G-conjugate of θ with τ1(1)=σ1(1), then τ1=σ1.

  2. Either σ1 is super-primitive or [χN,θ]=1.

Proof.

Write χ=ξG, where ξIrr(H) and H<G. Assume that the conditions hold but the result is false. Then G=HN and K:=HN<N. To find a contradiction, we may assume that H is maximal in G. Since χIrr(G|θ) and

(3.1)(ξK)N=(ξG)N=χN

by the reciprocity, all irreducible components of (ξK)N are conjugate to θ in G, and in particular are of the same degree θ(1). By Proposition 2.4, we need only to investigate the following cases.

Suppose that the first case in Proposition 2.4 holds. Then K=K1××Kt, where Ki<Si for all i. Since χIrr(G|θ), there exists an irreducible constituent λ of ξK such that [θ,λN]>0. Write λ=1itλi, where λiIrr(Ki). Note that (see, for example, [2, Lemma 1])

(3.2)λN=(λ1)S1××(λt)St.

Since all irreducible constituents of λN have the same degree, we get by (3.2) that all members of Irr(S1|λ1) have the same degree, say d. Clearly σ1Irr(S1|λ1) as θIrr(N|λ), it follows that d=σ1(1). Observe that by (3.1) and (3.2) every member of Irr(S1|λ1) is the first component of some G-conjugate of θ. Now condition (1) implies that (λ1)S1=mσ1 for some m+. So σ1 is not super-primitive, and it follows by condition (2) that [χN,θ]=1. Now

1=[χN,θ]=[(ξK)N,θ][λN,θ][(λ1)S1,σ1]=m,

we get that m=1 and that σ1=(λ1)S1 is imprimitive, a contradiction.

Suppose that the second case in Proposition 2.4 holds. We may assume that K=A1×A* and N=B1×B*, where SA1<B1, B1=S1××Sl with l2, and 1A*B*. Let U=S2××Sl. Since every nonidentity element of A1 has length l under the decomposition B1=S1××Sl, we have

(3.3)B1=A1U,A1U=1,UB1.

Let λ be an irreducible constituent of ξK. Write λ=λ1×λ*, where λ1Irr(A1), λ*Irr(A*). Since all irreducible constituents of λN are of the same degree θ(1) and λN=(λ1)B1×(λ*)B*, all irreducible constituents of (λ1)B1 have the same degree, say d. Observe that by (3.3) λ1Irr(A1) extends to an irreducible character of B1 with kernel U, it follows that d=λ1(1). Since A1S and U is a direct product of l-1 copies of S, there exists τIrr(U) such that τ(1)=d. As B1=S1×U, we may write

(3.4)λ1B1=ψIrr(S1)a(ψτ)ψτ+ψIrr(S1)ξIrr(U),ξτa(ψξ)ψξ,

where a(ψτ),a(ψξ).

Suppose that a(ψτ)>0. Then (ψτ)(1)=d, so ψ=1S1. Since λ1 is irreducible and λ1(1)=((1S1τ)A1)(1), we have [λ1,(1S1τ)A1]{0,1}. By (3.4) and the reciprocity, we get that

(3.5)a(1S1τ)=[(λ1)B1,1S1τ]=[λ1,(1S1τ)A1]=1.

Since ((λ1)B1)U=((λ1)A1U)U=dξIrr(U)ξ(1)ξ, we have

(3.6)d2=[((λ1)B1)U,τ].

By (3.6), (3.4) and (3.5), we get that

d2=[(ψIrr(S1)a(ψτ)ψτ)U,τ]=a(1S1τ)=1.

Hence d=1, so λ1=1A1. As A1 is a proper subgroup of B1, (1A1)B1 has an irreducible constituent of degree exceeding d=1, a contradiction. ∎

Corollary 3.4.

Assume that G and N satisfy Hypothesis 1.1 and ψPri(G/N). Let σPriext(G)(S1), and let χ be an extension of θ:=σG^Irr(N) to G (see Lemma 3.1). Then any one of the following conditions guarantees the primitivity of χψ:

  1. ψ is linear.

  2. σ is super-primitive.

Proof.

By [12, Corollary 6.17], χψ is irreducible. Assume that either ψ is linear or σ is super-primitive, but that χψ is imprimitive. Then χψ=ηG, where ηIrr(H), H is maximal in G. Observe that χψIrr(G|θ), σ is the first component of θx=θ for all xG, and that either σ is super-primitive or, ψ is linear and so [(χψ)N,θ]=1. Hence Proposition 3.3 is applied, and we get that

NH<G.

Write χH=λ. Clearly λ is an extension of θ to H. Note that if ν1,ν2Irr(H/N), then λν1=λν2 if and only if ν1=ν2 (see [12, Corollary 6.17]). Let

ψH=1imbiμi,

where bi+, μ1,,μmIrr(H/N) are distinct. Then

(χψ)H=1imbiλμi,

where η=λμ1 and λμi are distinct irreducible characters of H. Put

(μ1)G=1jscjψj,

where cj+, ψ1=ψ,ψ2,,ψsIrr(G/N) are distinct. Clearly

c1=[μ1G,ψ1]=[μ1,ψH]=b1=[(χψ)H,η]=[χψ,ηG]=1.

Since θ extends to χIrr(G), applying [12, Corollary 6.17] again we get that χψj are irreducible and distinct. Observe that [χψi,ηG]=[(χψi)H,η][λμ1,η]=1 and ηGIrr(G). It follows that s=1 and that μ1G=c1ψ1=ψ is imprimitive, a contradiction. ∎

Corollary 3.5.

Let G and N satisfy Hypothesis 1.1. Let χIrr(G|θ) and let θ=1itσiIrr(N), where σiIrr(Si), 1S1σ1Priext(G)(S1) is super-primitive, and σj(1)σ1(1) holds for every j2. Assume that χ=λG, where λIrr(H) and HG. Then S1Hg for some gG, σ1(1)λ(1), and in particular χ is nonmonomial.

Proof.

Suppose that HN=G. Let xG and let τ1 be the first component of θx. If xNG(S1), then σ1x=σ1, so τ1=σ1; and if xNG(S1), then τ1=σix for some i2, so τ1(1)σ1(1). Thus conditions (1) and (2) in Proposition 3.3 hold, so H=G, and the result follows.

Suppose that HN<G. Let ψ=λHN. Since ψG=χ and NG, some G-conjugate of θ is a constituent of ψN. Replacing H, λ, HN and ψ by their suitable G-conjugates if necessary, we may assume that [ψN,θ]>0. By Lemma 2.2, we may assume that N=N1×N2, where N1=S1××Sk is minimal normal in HN and N2=Sk+1××St is normal in HN. Let θ1=1ikσi. Then we have ψIrr(HN|θ1). Replacing G,N,χ,θ,H,λ by HN,N1,ψ,θ1,H,λ, respectively, we get the required result by induction. ∎

4 Priext(S) for a nonabelian simple group S

In this section, we investigate the set Priext(S) for a nonabelian simple group S.

Table 1
Sθ1θ1(1)θ2θ2(1)
M11χ210χ616
M12χ645χ754
J1χ256χ476
M22χ345χ8210
J2χ636χ763
M23χ222χ345
F42(2)χ427χ678
HSχ222χ7175
J3χ6324χ9816
M24χ345χ7252
McLχ222χ4252
Heχ6680χ91,275
Ruχ2378χ4406
Suzχ2143χ3364
O’Nχ210,944χ726,752
Co3χ223χ6896
Co2χ223χ62,024
Fi22χ278χ73,080
HNχ4760χ53,344
Lyχ22,480χ445,694
Thχ2248χ34,123
Fi23χ2782χ33,588
Co1χ2276χ3299
Fi24χ33721723χ4211172329
J4χ21,333χ6232313743
Bχ33352331χ4217233147
Mχ2475971χ32231415971

Lemma 4.1.

Let S be one of the sporadic simple groups or F42(2). Then two members θ1,θ2 of Priext(S) and their degrees are listed in Table 1, where χi are labeled as [6].

Proof.

We make some remarks on the choice of θ1 and θ2. Since Aut(S)/S2, every Aut(S)-invariant θIrr(S) extends to Aut(S).

Assume that S does not belong to {Fi22,Th,Fi23,J4,Fi24,B,M}. By [6], we may take Aut(S)-invariant θ1,θ2Irr(S) such that |S:M| divides neither θ1(1) nor θ2(1) for every maximal subgroup M of S. Then θ1 and θ2 are primitive, so θ1,θ2Priext(S).

Assume that S{Fi22,Th,Fi23,J4,Fi24,B,M}. For these cases, there are only some maximal subgroups of S listed in [6]. The characters θ1,θ2 in the table are of “small” degree. Actually, θ1(1)<θ2(1), θ2(1) does not exceed the third minimal degree (excluding 1) of S unless S=Fi22. Note that if θ1 is of the first minimal degree, then θ1 is primitive (see [17, Lemma 2.8]). We can prove the primitivity of θ1 and θ2 directly. For example, we show that θ2 is primitive when S=B. The first three minimal character degrees of B are

χ2(1)=33147,χ3(1)=3352331,χ4(1)=217233147.

Suppose that θ2=χ4 is imprimitive. Then there exists a proper subgroup H of S such that |S:H| divides θ2(1). As (1H)S=1G+iηi, where ηiIrr(H) are nonlinear, we have that

k(1+aχ2(1)+bχ3(1))=k(1G+iηi)(1)=χ4(1),

where k+, a,b, a+b1. Since 31 divides χ2(1), χ3(1) and χ4(1), while χ4(1)/31<χ3(1), we have 31k, b=0. So

(1+aχ2(1))k31=χ4(1)31.

Modulo 23 on both sides, we get a contradiction. Thus θ2 is primitive. ∎

Lemma 4.2 ([8]).

Let SAn, and let σIrr(S) be corresponding to the partition α of n. Then σ is imprimitive if and only if one of the following occurs:

  1. n=m2+1, α=(m+1,mm-1),

  2. n=2m, α=(m+1,1m-1),

  3. n=8, α=(4,2,1,1) or (4,3,1),

  4. n=9, α=(5,2,2).

Lemma 4.3.

Let SAn, n9. Then Priext(S) contains two members of distinct degrees, contains a member whose degree is not square-free, contains a member whose degree is not a prime power, and contains a member of even degree.

Proof.

Suppose that θ1,θ2Irr(S) correspond to the partitions α1=(n-3,2,1) and α2=(n-3,1,1,1) of n, respectively. Clearly α1 and α2 are not self-associated, and so θ1 and θ2 extend to Sn=Aut(S). Also, θ1 and θ2 are primitive by Lemma 4.2. Observe that

θ1(1)=n!(n-1)(n-3)(n-5)!3=n(n-2)(n-4)3

and

θ2(1)=n!n(n-4)!3!=(n-1)(n-2)(n-3)6.

Clearly θ1(1)θ2(1), and θ2(1) is not a prime power. Also, it is easy to see that if n is even, then 4θ1(1); and if n is odd, then 4θ2(1). ∎

Remark 4.4.

Note that A5,A6,A8 will be treated as simple groups of Lie type. By [6] and Lemma 4.2, Priext(A7) contains 6 members and their degrees are 6, 14, 14, 15, 21, 35, respectively. It is easy to verify that the irreducible character of A7 with degree 6 is super-primitive. For the super-primitive characters of An,n7, we refer the readers to [14, Proposition 4.1].

In the rest of this section, we will investigate the simple groups S of Lie type. It is well known that the Steinberg character of S extends to Aut(S) (see [19]). Furthermore, Malle [16] proved that almost all unipotent characters of S are extendible to Aut(S). Recently, Hiss, Husen and Magaard [10] showed that almost all unipotent characters of S are primitive. This enables us to find “a lot of” members in Priext(S) unless SL2(q).

There are exactly the following exceptional isomorphisms between nonabelian simple groups (see [6]):

L2(4)L2(5)A5,L3(2)L2(7),L2(9)Sp4(2)A6,
L4(2)A8,G22(3)L2(8),G2(2)U3(3),
U4(2)Sp4(3).

The following follows directly from [6].

Lemma 4.5.

Assume that S is a nonabelian simple group of Lie type and is isomorphic to a simple group of Lie type of a different defining characteristic. Then some members, say θ1,θ2, of Priext(S) are listed in the following table.

Sθ1θ1(1)θ2θ2(1)
L2(4)L2(5)χ44
L3(2)L2(7)χ46
L2(9)Sp4(2)χ69
G22(3)L2(8)χ27χ68
G2(2)U3(3)χ26χ1027
U4(2)Sp4(3)χ46χ920

Lemma 4.6 ([10, Theorem 6.1]).

Let G be a quasisimple covering group of a simple group of Lie type, assume that G/Z(G) has no exceptional multiplier and that G/Z(G) is not isomorphic to a simple group of Lie type of a different defining characteristic. Let χIrr(G) be imprimitive and let H be a maximal subgroup of G such that χ is induced by an irreducible character of H. Then H is a parabolic subgroup of G.

Let G be a finite group with a split BN-pair satisfying the commutator relations. An irreducible character χ of G is called Harish-Chandra imprimitive if it is Harish-Chandra induced from a proper Levi subgroup of G. Otherwise, it is called Harish-Chandra primitive, see [10, Chapter 7]. By [10, Proposition 7.1], an irreducible character χ of G is induced by a parabolic subgroup of G if and only if χ is Harish-Chandra imprimitive.

Lemma 4.7 ([10, Corollary 8.5]).

Let G be a connected reductive algebraic group over the algebraic closure of Fq and let F be a Frobenius morphism of G. Let G=GF be the corresponding finite group of Lie type. Then the unipotent characters of G are Harish-Chandra primitive.

Corollary 4.8.

Let S be a simple group of Lie type, and assume that S is not isomorphic to a simple group of Lie type of a different defining characteristic. Then the unipotent characters of S are primitive.

Proof.

This follows from Lemma 4.6 and Lemma 4.7.∎

Lemma 4.9 ([16, Theorem 2.4, Theorem 2.5]).

Let S be a simple group of Lie type and let χ be a unipotent character of S. Then χ extends to its inertia group in Aut(S); furthermore, χ is Aut(S)-invariant except in the following cases.

  1. S=Dn(q) with even n4, the graph automorphism of order 2 interchanges the two unipotent characters in all pairs labeled by the same degenerate symbol of defect 0 and rank n.

  2. S=D4(q), the graph automorphism of order 3 has two nontrivial orbits with characters labeled by the symbols

    (22),(22),(1401),(1212),(1212),(124014).
  3. S=C2(22f+1), the graph automorphism of order 2 interchanges the two unipotent principal series characters labeled by the symbols

    (120),(012).
  4. S=G2(32f+1), the graph automorphism of order 2 interchanges the two unipotent principal series characters labeled by the characters ϕ1,3, ϕ1,3′′ of the Weyl group W(G2).

  5. S=F4(22f+1), the graph automorphism of order 2 has eight orbits of length 2 , consisting of the unipotent characters labeled by

    {ϕ8,3,ϕ8,3′′},{ϕ8,9,ϕ8,9′′},{ϕ2,4,ϕ2,4′′},
    {ϕ2,16,ϕ2,16′′},{ϕ9,6,ϕ9,6′′},{ϕ1,12,ϕ1,12′′},
    {ϕ4,7,ϕ4,7′′},{(B2,ϵ),(B2,ϵ′′)}.

Lemma 4.10.

Let S be a simple group of Lie type. Assume that S is not of type L2(q) and that S is not isomorphic to a simple group of Lie type of a different defining characteristic. Then Priext(S) contains two members of distinct degrees, contains a member whose degree is not square-free, contains a member whose degree is not a prime power, and contains a member of even degree.

Proof.

Let St be the Steinberg character of S. Then St extends to Aut(S) and is primitive by Corollary 4.8, so StPriext(S). Clearly St(1) is not square-free. Now it suffices to find χPriext(S) such that χ(1)St(1), χ(1) is even but not a prime power.

Case 1. Assume that S is of classical type. By [5, Section 13.8], we can find a unipotent character χα of S corresponding to a partition or symbol α. The degree of χα and the partition or symbol α are given in Table 2.

Table 2
Sαχα(1)
Al(q),l2,l0(mod 2)(1,l)q(ql-1)q-1
Al(q),l5,l1(mod 4)(1,1,l-1)q3(ql-1)(ql-1-1)(q-1)(q2-1)
Al(q),l3,l3(mod 4)(2,l-1)q2(ql-2-1)(ql+1-1)(q-1)(q2-1)
Al2(q),l2,l0(mod 2)(1,l)q(ql-1)(q+1)
Al2(q),l5,l1(mod 4)(1,1,l-1)q3(ql-1-1)(ql+1)(q+1)(q2-1)
Al2(q),l3,l3(mod 4)(2,l-1)q2(ql-2+1)(ql+1-1)(q+1)(q2-1)
Bl or Cl(01l-)q(ql-1)(ql-1-1)2(q+1)
Dl,l4(012l-1-)q3(ql-1)(ql-1-1)(ql-2-1)(ql-3-1)2(q+1)2(q2+1)
Dl2(q),l4,l0(mod 2)(1l-1-)q(ql-2-1)(ql+1)(q2-1)
Dl2(q),l5,l1(mod 2)(01l1)q2(q2l-2-1)(q2-1)

Observe that the exceptional cases listed in Lemma 4.9 do not happen, it follows that χα is extendible to Aut(S). Now Corollary 4.8 implies that χαPriext(S). Clearly χα(1)St(1), χα(1) is not a prime power. Also, it is easy to see that χα(1) is even.

Case 2. Assume that S is of exceptional type. Applying [5, Section 13.9], Lemma 4.9 and Corollary 4.8, we can find a unipotent χ of S that meets the requirements as shown in Table 3.

Table 3
Sχχ(1)
G2(q)G2(θ)13qΦ12Φ22
F4(q)ϕ9,2q2Φ32Φ62Φ12
E62(q2)ϕ2,4qΦ8Φ18
E8(q)ϕ8,1qΦ42Φ8Φ12Φ20Φ24
G22(q2)cuspidal13qΦ1Φ2Φ4
E6(q)ϕ6,1qΦ8Φ9
D43(q3)ϕ2,212q3Φ22Φ12
E7(q)ϕ56,312q3Φ24Φ62Φ7Φ10Φ14Φ18
B22(q2)B22[a]12qΦ1Φ2
F42(q2)B22[a],ε12q13Φ1Φ2Φ42Φ6

Proposition 4.11.

Let S be a nonabelian simple group and assume that S is not isomorphic to a simple group of type L2(q). Then the following hold:

  1. There are two nonprincipal members in Priext(S) of distinct degrees.

  2. There is a member in Priext(S) whose degree is not square-free, unless SA7.

  3. There is a member in Priext(S) whose degree is not a prime power.

  4. There is a member in Priext(S) whose degree is even.

Proof.

This follows by Lemmas 4.1, 4.3, 4.5, 4.10, Remark 4.4 and the classification of finite simple groups. ∎

Now we investigate S=L2(q), where q=pf4. The outer automorphism group of S is of order gcd(p-1,2)f, and is generated by a field automorphism φ of order f and, if p is odd, a diagonal automorphism δ of order 2. It is well known that

cd(PGL2(q))={1,q-1,q,q+1}

and

cd(L2(q))={1,12(q+(-1)(q-1)/2),q-1,q,q+1}if q7 is odd,

and that PGL2(q)=S if q is even, PGL(2,q)=Sδ if q is odd.

Lemma 4.12 ([7]).

For even q=pf4, the maximal subgroups of L2(q) are as follows:

  1. a Frobenius group of order q(q-1),

  2. D2(q-1) a dihedral group of order 2(q-1),

  3. D2(q+1),

  4. PGL2(q0), where q=q0r for some prime r and q02.

For odd q=pf5, the maximal subgroups of L2(q) are as follows:

  1. a Frobenius group of order q(q-1)/2,

  2. Dq-1 for q13,

  3. Dq+1 for q7,9,

  4. PGL2(q0) for q=q02,

  5. L2(q0) for q=q0r, where r an odd prime,

  6. A5 for q±1(mod 10), where q=p or q=p2 and p±3(mod 10),

  7. A4 for q=p±3(mod 8) and q±1(mod 10),

  8. S4 for q=p±1(mod 8).

Corollary 4.13.

Let H be a maximal subgroup of L2(q), q=pf4. Then the following statements hold:

  1. If q=4, then q(q+1)|H|; and if q=2f8, then q(q+1)f|H|.

  2. If p3, then q(q+1)2f|H|, q(q-1)|H|.

Proof.

We only prove (2). The possible orders of H are listed in Lemma 4.12. Note that if (q+1)(q-1)k for some k+, then (q+1)2k.

Assume that |H|=q(q-1)/2. If q(q+1)2f|H|, then (q+1)2f, a contradiction. Clearly q(q-1)|H|.

Assume that |H|=q-1, q+1, |PGL2(q0)| or |L2(q0)|, where q0 is a proper divisor of q. Then the required result is obvious.

Assume that |H|=|A5| for q±1(mod 10), where either q=p or q=p2 with p±3(mod 10). If f=1 and q(q+1)2f|H|, we have q=p11, q(q+1)>120=2f|H|, a contradiction; if f=2 and q(q+1)2f|H|, then q=p2 with p±3(mod 10), p2(p2+1)>240=2f|H|, a contradiction. Thus q(q+1)2f|H|. If q(q-1)|H|, then q<9, a contradiction.

Similarly, we get the result for the cases when HA4 or S4. ∎

Lemma 4.14.

Let SL2(q), where q=pf4.

  1. Let σIrr(S) be such that σ(1)=4 if q=4,5, σ(1)=6 if q=7, σ(1)=q if q8. Then σ is super-primitive and extendible to Aut(S).

  2. Let θIrr(S) be of degree q-1 or, 12(q+(-1)(q-1)/2) for odd q. Then θ is primitive.

  3. Assume that q=p5 and χIrr(S) has degree p-1. Then χ is super-primitive and extendible to Aut(S).

Proof.

(1) Clearly σ is extendible to Aut(S). The super-primitivity of σ follows by [14], note that this can be proved directly.

(2) By Corollary 4.13, S has no subgroup H such that |S:H|θ(1), so θ is primitive.

(3) As cd(PGL2(p))={1,p-1,p,p+1}, χ extends to Aut(S)PGL2(p). Suppose that χ is not super-primitive. There exist a maximal subgroup H of G, an irreducible character λ of H and a positive integer k such that λS=kχ. So

(4.1)λ(1)|S:H|=k(p-1),|S:H|=kχ(1)λ(1)k2.

Clearly λ is nonprincipal because 1G is a constituent of (1H)G. To find a contradiction, we have to apply Lemma 4.12 and investigate the maximal subgroup H case by case.

Suppose that H is a Frobenius group of order p(p-1)/2. Then λ(1)=1 or (p-1)/2, |S:H|=p+1. Since λ(1)(p+1)=k(p-1) by (4.1), it follows that (p-1)2λ(1) and so λ(1)=(p-1)/2. Then k=(p+1)/2>|S:H|, a contradiction.

Suppose that H=Dp-1. Then we have λ(1)=1,2, |S:H|=p(p+1)/2, and λ(1)p(p+1)/2=k(p-1) by (4.1). Then (p-1)2λ(1), thus p=5 and λ(1)=2. This implies that k=30/4, a contradiction.

Suppose that H=Dp+1. Then we have λ(1)=1,2, |S:H|=p(p-1)/2, and λ(1)p(p-1)/2=k(p-1). It follows that k=λ(1)p/2=p as k+, so k>|S:H|, a contradiction.

Now we consider the cases when H=A5, A4 or S4. Since

|S:H|k2=(λ(1)|S:H|p-1)2,

we have

2(p-1)|H|λ(1)2p(p+1)>λ(1)2(p-1)2,

and so

(4.2)p<1+2|H|λ(1)2.

Suppose that H=A5, where p±1(mod 10). Then λ(1)=3,4,5, and so λ(1)=3 and p=11 by (4.2). This implies that k=3|S:H|/(p-1)=33/10, a contradiction.

Suppose that H=A4, where p±3(mod 8) and p±1(mod 10). It follows that λ(1)=1,3, so λ(1)=1 and p=5 or 13 by (4.2). This implies that k=|S:H|/(p-1)=5/4 or 91/12, a contradiction.

Suppose that H=S4, where p±1(mod 8). By (4.2), we have λ(1)=1,2. If λ(1)=2, then p=7 by (4.2), so k=7/3 by (4.1), a contradiction. If λ(1)=1, then p<49 by (4.2). Since p±1(mod 8) and

k=|S:H|p-1=p(p+1)48+,

we get that p=47. Then k=47>|S:H|, a contradiction. ∎

Lemma 4.15.

Let SGAut(S), where S=L2(q) with q=pf5, and let θIrr(S) be of degree q-1. Then all irreducible constituents of θG are nonmonomial.

Proof.

Assume that χIrr(G|θ) is monomial. Then there exists a linear character λ of a subgroup H such that χ=λG. Clearly K:=HS<S. Observe that |S:K| divides χ(1) and that χ(1)fθ(1) because θ extends to PGL2(q). It follows that q(q+1)gcd(2,q-1)f|K|. As a consequence of Corollary 4.13, we get a contradiction. ∎

5 Theorems

Remark 5.1.

In order to prove the theorems, by induction we need only to consider the case when G is nonsolvable with Sol(G)=1.

Then G has a minimal normal subgroup N, and G and N satisfy Hypothesis 1.1. By Proposition 4.11 and Lemma 4.14 (1), there exists a primitive character of S1 that is extendible to Aut(S).

Let 1S1αPriext(G)(S1). By part (1) of Corollary 3.4, αG^Irr(N) extends to a primitive character of G of degree α(1)t. Assume that all nonlinear primitive characters of G are of the same degree (or of square-free degree; of prime power degree; of odd degree, respectively). Then all members in Priext(G)(S1) are of the same degree (or of square-free degree; of prime power degree; of odd degree, respectively). By Proposition 4.11, we get that S1A7 or, L2(q), where q=pf4. Note that Priext(A7) contains six members and their degrees are 6, 14, 14, 15, 21, 35, respectively.

Let σIrr(S1) be such that

σ(1)={4if S1L2(4),L2(5),6if S1A7,L2(7),qif S1L2(q),q8.

By Remark 4.4 and Lemma 4.14, σ is super-primitive and extendible to Aut(S1). Let χ1 be an extension of σG^ to G. Then χ1 is primitive by Corollary 3.4.

Assume that N is not simple. Let θ=1itσi, where σ1=σ is as above, and every σjIrr(Sj),j2, has degree divisible by a prime r that is coprime to σ(1). Let χ2Irr(G|θ). By Corollary 3.5, χ2 is nonmonomial. Clearly we have χ2(1)χ1(1).

Assume that NL2(pf) is simple, where pf4. Let βIrr(N) be of degree pf-1 and let χ3Irr(G|β). By Lemma 4.15, χ3 is nonmonomial unless NL2(4). Note that if in addition pf=p, then β is super-primitive and extendible to G, see Lemma 4.14 (3).

Assume that G/N is nonsolvable. Using the same arguments as above, we see that G/N possesses a nonlinear primitive character, say ψ0. Let χ4=χ1ψ0. By Corollary 3.4 (2), χ4 is also primitive.

Assume that G/N is solvable. Then NGAut(N) because Sol(G)=1.

In what follows, we always keep these notations in order to avoid needless duplication.

Proof of Theorem A1.

We may assume that Sol(G)=1 and that G and N satisfy Hypothesis 1.1. If G/N is nonsolvable, then χ1,χ4 are primitive and of different degrees, a contradiction. Hence G/N is solvable. By the remark, we get that S1L2(q), where q=pf4. Clearly χ1(1)=4t if q=4 or 5, χ1(1)=6t if q=7, and χ1(1)=qt if q8. Now Theorem A1 holds.∎

Proof of Theorem A2.

Suppose that G is nonsolvable and let G be a counterexample of minimal order. Then NGAut(N), where G and N satisfy Hypothesis 1.1.

Assume that N is not simple. Then χ1 and χ2 are nonmonomial and of different degrees, a contradiction.

Assume that N is simple. Note that NL2(q) by Theorem A1. If q=4,5 and G=NA5, then 3 and 4 are nonmonomial character degrees of G; if q=4,5 and G>NA5, then 4 and 5 are nonmonomial character degrees of G; if q=7 and G=NL2(7), then 3 and 6 are nonmonomial character degrees of G; if q=7 and G>N, then 6 and 7 are nonmonomial character degrees of G; if q8, then χ1 and χ3 are nonmonomial and of different degrees. We get a contradiction for each of these cases. ∎

Proof of Theorem B1.

We may assume that Sol(G)=1 and that G and N satisfy Hypothesis 1.1. By the remark and investigating χ1(1), we get that NA7 or, L2(p) where p7. Let γIrr(N) be such that γ(1)=6 if NA7, and γ(1)=p-1 if NL2(p). Then γ is super-primitive and extends to a primitive character χ5 of G. Note that χ5(1) is even. Assume that G/N is nonsolvable. Similarly, we may find a primitive character ψ of G/N of even degree. Clearly 4(χ5ψ)(1). However, Corollary 3.4 (2) yields that χ5ψ is primitive, a contradiction. Hence G/N is solvable, so NGAut(N) and the theorem holds.∎

Proof of Theorem B2.

Since S7 has a nonmonomial character of degree 20, Theorem B2 follows directly from Theorem B1.∎

Remark on Theorem B2.

Let HL2(p) or PGL2(p), where p-1 is square-free. Observe that p3(mod 4), cd(L2(p))={1,12(p-1),p-1,p,p+1} and cd(PGL2(p))={1,p-1,p+1,p}. Let ωIrr(H) be of degree p+1. It is easy to check that ω is induced by a linear character of NH(P), where PSylp(H). Now all irreducible characters of H are either monomial or of square-free degree. So, it seems impossible to say anything more than what is stated in Theorem B2.

Proof of Theorem C1.

We may assume that Sol(G)=1 and that G and N satisfy Hypothesis 1.1. We get by the remark that S1L2(q), where q=pf=4 or 8, and that χ1(1)=pft. Assume that G/N is nonsolvable and let K be a nonabelian composition factor of G/N. Similarly, we get that KL2(p1f1), p1f1=4 or 8, and that G/N has a primitive character ψ0 whose degree is a power of p1. Since χ1ψ0 is also primitive, we get that p=p1, and we are done. ∎

Proof of Theorem C2.

We may assume that Sol(G)=1 and that G and N satisfy Hypothesis 1.1. If N is not simple, then χ2 is nonmonomial and its degree is not a prime power, a contradiction. So NL2(pf), where pf=4 or 8. Assume that G/N is nonsolvable and let ψIrr(G/N) be such that ψ(1) is not a power of p. Then χ1ψ is nonmonomial by Corollary 3.5 and its degree is not a prime power, a contradiction. Hence G/N is solvable, so NGAut(N). Recall that if pf8, then χ3Irr(G) is nonmonomial and of degree divisible by pf-1. Thus pf-1 is a power of a prime r.

Assume that p3. As is well-known, we have either pf=9 or pf=p, so (1) or (2) occurs.

Assume that q=4. Then (3) or (4) occurs.

Assume that q=2f8. Since 2f-1 is a power of a prime r, we have that 2f-1=r and that f is an odd prime. Therefore |G:N|=1 or f. Suppose that G>N. By [20, Lemma 5.2], N is a stabilizer in GAut(L2(2f)) of an irreducible character of N of degree 2f-1. So, we may assume that χ3(1)=(2f-1)f. However, χ3 is nonmonomial and its degree is divisible by different primes r and f, a contradiction. Hence G=NL2(2f) and (4) follows. ∎

Proof of Theorem D1.

Considering the degree of χ1, we get the theorem by the remark. ∎

Proof of Theorem D2.

Let G be a counterexample of minimal order. Then we have NGAut(N), where G and N satisfy Hypothesis 1.1. By Theorem D1, S1L2(pf), where p>2 and pf9. If N is not simple, then we may assume θ(1) is even, and then the nonmonomial character χ2 has even degree, a contradiction. If N is simple, then the nonmonomial character χ3 has even degree, a contradiction. ∎

Corollary 5.2.

Assume that all nonlinear primitive characters of G are of prime degree. Then G is solvable.

Proof.

Let G be a counterexample of minimal order. By Theorem B1, there is a normal subgroup N of G such that NGAut(N), where NA7 or L2(p). As shown in the proof of Theorem B1, χ5Pri(G) has degree 6 if NA7 and p-1 if NL2(p). Clearly χ5(1) is not a prime, a contradiction.∎

Corollary 5.2 implies the following statement, which was conjectured by Berkovich (see [3, p. 38, Conjecture 4]) and was already confirmed in [18].

Corollary 5.3.

Assume that all nonmonomial characters of G are of prime degree. Then G is solvable.

Corollary 5.4 ([3, p. 38, Conjecture 5]).

Assume that all nonmonomial character degrees of G are powers of a fixed prime. Then G is solvable.

Proof.

Let G be a counterexample of minimal order. Then Sol(G)=1 and G is one of the groups listed in Theorem C2. If GS5, then 4 and 5 are nonmonomial character degrees of G, a contradiction. If GL2(4)L2(5), then 3 and 4 are nonmonomial character degrees of G, a contradiction. For each of other cases, there exists a minimal normal subgroup N of G such that NGAut(N), where NL2(pf), pf8. As shown in the proof of Theorem C2, G has two nonmonomial characters χ1 and χ3 such that pχ1(1) and (p-1)χ3(1), a contradiction. ∎


Communicated by Robert M. Guralnick


Award Identifier / Grant number: 11471054

Award Identifier / Grant number: 11671063

Award Identifier / Grant number: BK20161265

Funding statement: Project supported by the NSF of China (No. 11471054, No. 11671063) and the NSF of Jiangsu Province (No. BK20161265).

Acknowledgements

The author is very grateful to the referee for his/her valuable suggestions.

References

[1] Y. Berkovich, Generalizations of M-groups, Proc. Amer. Math. Soc. 123 (1995), 3263–3268. 10.2307/2161064Search in Google Scholar

[2] Y. Berkovich, On the Taketa theorem, J. Algebra 182 (1996), 501–510. 10.1006/jabr.1996.0183Search in Google Scholar

[3] Y. Berkovich and E. M. Zhmud’, Characters of Finite Groups. II, American Mathematical Society, Providence, 1998. 10.1090/mmono/181Search in Google Scholar

[4] M. Bianchi, D. Chillag, M. L. Lewis and E. Pacifici, Character degree graphs that are complete graphs, Proc. Amer. Math. Soc. 135 (2007), 671–676. 10.1090/S0002-9939-06-08651-5Search in Google Scholar

[5] R. W. Carter, Finite Groups of Lie Type: Conjugacy Classes and Complex Characters, Wiley, New York, 1985. Search in Google Scholar

[6] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, Atlas of Finite Groups, Oxford University Press, Clarendon, 1985. Search in Google Scholar

[7] L. E. Dickson, Linear Groups: With an Exposition of the Galois Field Theory, Dover Publications, New York, 1958. Search in Google Scholar

[8] D. Z. Djokovic and J. Malzan, Imprimitive irreducible complex characters of the alternating group, Canad. J. Math. 28 (1976), no. 6, 1199–1204. 10.4153/CJM-1976-119-xSearch in Google Scholar

[9] P. Ferguson and I. M. Isaacs, Induced characters which are multiples of irreducibles, J. Algebra 124 (1989), 149–157. 10.1016/0021-8693(89)90156-7Search in Google Scholar

[10] G. Hiss, W. J. Husen and K. Magaard, Imprimitive irreducible modules for finite quasisimple groups, Mem. Amer. Math. Soc. 234 (2015), no. 1104. 10.1090/memo/1104Search in Google Scholar

[11] B. Huppert and O. Manz, Degree problems I: Squarefree character degrees, Arch. Math. 45 (1985), 125–132. 10.1007/BF01270483Search in Google Scholar

[12] I. M. Isaacs, Character Theory of Finite Groups, Academic Press, New York, 1976. Search in Google Scholar

[13] I. M. Isaacs, Generalizations of Taketa’s theorem on the solvability of M-groups, Proc. Amer. Math. Soc. 91 (1984), no. 2, 192–194. 10.2307/2044624Search in Google Scholar

[14] T. Le, J. Moori and H. P. Tong-Viet, A generalization of M-group, J. Algebra 374 (2013), 27–41. 10.1016/j.jalgebra.2012.10.018Search in Google Scholar

[15] M. L. Lewis and D. L. White, Connectedness of degree graphs of nonsolvable groups, J. Algebra 266 (2003), 51–76. 10.1016/S0021-8693(03)00346-6Search in Google Scholar

[16] G. Malle, Extensions of unipotent characters and the inductive McKay condition, J. Algebra 320 (2008), 2963–2980. 10.1016/j.jalgebra.2008.06.033Search in Google Scholar

[17] G. Qian, Two results related to the solvability of M-groups, J. Algebra 323 (2010), 3134–3141. 10.1016/j.jalgebra.2010.03.017Search in Google Scholar

[18] I. A. Sagirov, Finite groups with nonmonomial characters of prime degree, Math. Notes 74 (2003), no. 5, 671–675. 10.1023/B:MATN.0000008999.85474.f9Search in Google Scholar

[19] P. Schmid, Extending the Steinberg representation, J. Algebra 150 (1992), 254–256. 10.1016/S0021-8693(05)80060-2Search in Google Scholar

[20] D. L. White, Character degrees of extensions of PSL2(q) and SL2(q), J. Group Theory 16 (2013), no. 1, 1–33. 10.1515/jgt-2012-0026Search in Google Scholar

Received: 2017-3-29
Revised: 2017-9-27
Published Online: 2017-11-14
Published in Print: 2018-3-1

© 2018 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 23.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/jgth-2017-0037/html?lang=en
Scroll to top button