Nonsolvable Groups All of Whose Character Degrees are Odd-Square-Free

A finite group G is odd-square-free if no irreducible complex character of G has degree divisible by the square of an odd prime. We determine all odd-square-free groups G satisfying S ≤ G ≤ Aut(S) for a finite simple group S. More generally, we show that if G is any nonsolvable odd-square-free group, then G has at most two nonabelian chief factors and these must be simple odd-square-free groups. If the alternating group A ₇ is involved in G, the structure of G can be further restricted.     

Groups with Four Character Degrees and Derived Length Four

In this article, we consider solvable groups that have four character degrees and derived length four.     

特征标次数素图中不含三角形的单群

讨论了不可约特征标次数素图中不含三角形的单群.证明了:若G是有限单群且其素图中不含三角形,则G(≌)L2(q),其中q≥4,且满足条件|π(q+1)| ≤ 2和|π(q-1)|≤2.     

Prime Divisibility Among Degrees of Solvable Groups

Abstract

Let G be a finite, nonabelian, solvable group. Following work by D. Benjamin, we conjecture that some prime must divide at least a third of the irreducible character degrees of G. Benjamin was able to show the conjecture is true if all primes divide at most 3 degrees. We extend this result by showing if primes divide at most 4 degrees, then G has at most 12 degrees. We also present an example showing our result is best possible.     

Finite Groups with a Given Set of Character Degrees

Let G be a finite group with {1, q, r, qm, q ² m, rqm} as the character degree set, where r and q are distinct primes and m>1 is an integer not divisible by q or r. We show that G is solvable and the derived length of G equals 3.     

不可约特征标次数为等差数的有限可解群

设G为有限群,cd(G)表示G的所有复不可约特征标次数的集合.本文研究了不可约特征标次数为等差数的有限可解群,得到两个结果:如果cd(G)={1,1+d,1+2d,…,1+kd},则k≤2或cd(G)={1,2,3,4};如果cd(G)={1,a,a+d,a+2d,…,a+kd},|cd(G)|≥4,(a,d)=1,则cd(G)={1,2,2^e+1,2e+1,2^(e+1)},并给出了d>1时群的结构.     

Nonsolvable Groups Satisfying the One-prime Hypothesis

Recall that a finite group G satisfies the one-prime hypothesis if the greatest common divisor for any pair of distinct degrees in cd(G) is either 1 or a prime. In this paper, we classify the nonsolvable groups that satisfy the one-prime hypothesis. As a consequence of our classification, we show that if G is a nonsolvable group satisfying the one-prime hypothesis, then |cd(G)| ≤ 8, and hence, if G is any group satisfying the one-prime hypothesis, then |cd(G)| ≤ 9. Presented by Don Passman.     

特征标次数图是一种连通图的单群

对有限单群G,假设其不可约特征标次数图Δ(G)连通,且图顶点集ρ(G)=π_1∪π_2∪{p},其中|π_1|,|π_2|≥1,π_1∩π_2=θ,且π_1与π_2中顶点不相邻.证明了Δ(G)满足上面的假设的有限单群G只有4种:M_(11),J_1,PSL_3(4)或²B_2(q2B_2(q²),其中q2),其中q²一1是Mersenne素数.     

The Commuting Graph of Minimal Nonsolvable Groups

The purpose of this paper is to prove that if G is a finite minimal nonsolvable group (i.e. G is not solvable but every proper quotient of G is solvable), then the commuting graph of G has diameter 3. We give an example showing that this result is the best possible. This result is related to the structure of finite quotients of the multiplicative group of a finite-dimensional division algebra.     

Weyl Groups,Deformations of Linkage Classes,and Character Degrees For Chevalley Groups

With a Weyl group W and a positive integer p are associated p-linkage classes of weights [4,13]. Small deformations of such classes by elements of W are introduced here. These lead in turn to certain polynomials in p with highest term p^m, m = number of positive roots (one polynomial for each conjugacy class of W), which are written down explicitly for types A₁, A₂, B₂. These polynomials give (for each prime p) the degrees of the various large series of irreducible characters of the corresponding Chevalley group over the field of p elements. Indeed, the formal behavior of weights appears to reflect the actual behavior of the characters under reduction modulo p.     

Derived Lengths of Solvable Groups Having Five Irreducible Character Degrees I

Let G be a solvable group with five character degrees. We show that the derived length of G is at most 5. This verifies that the Taketa inequality, dl(G)|cd(G)|, is valid for solvable groups with at most five character degrees.     

Derived Lengths of Solvable Groups Having Five Irreducible Character Degrees II

Let G be a solvable group with five character degrees. Suppose that there is some prime p so that G/O ^p (G) is not Abelian. Also, assume that cd(G) contains a degree that is not divisible by p. Under these hypotheses, we show that the derived length of G is at most 4.     

Alternating and Sporadic Simple Groups are Determined by Their Character Degrees

Let G be a finite group. Denote by Irr(G) the set of all irreducible complex characters of G. Let cd(G) be the set of all irreducible complex character degrees of G forgetting multiplicities, that is, cd(G) = {χ(1) : χ ∈ Irr(G)} and let cd ^*(G) be the set of all irreducible complex character degrees of G counting multiplicities. Let H be an alternating group of degree at least 5, a sporadic simple group or the Tits group. In this paper, we will show that if G is a non-abelian simple group and cd(G) í cd(H)cd(G)\subseteq cd(H) then G must be isomorphic to H. As a consequence, we show that if G is a finite group with cd^*(G) í cd^*(H)cd^*(G)\subseteq cd^*(H) then G is isomorphic to H. This gives a positive answer to Question 11.8 (a) in (Unsolved problems in group theory: the Kourovka notebook, 16th edn) for alternating groups, sporadic simple groups or the Tits group.     

Common Divisor Character Degree Graphs of Solvable Groups with Four Vertices

Let G be a finite solvable group. The common divisor graph Γ(G) attached to G is a character degree graph. Its vertices are the degrees of the nonlinear irreducible complex characters of G, and different vertices m, n are adjacent if the greatest common divisor (m, n) > 1. In this article, we classify all graphs with four vertices that may occur as Γ(G) for solvable group G.     

On $ pi $ -Submaximal Subgroups of Minimal Nonsolvable Groups

Siberian Mathematical Journal - In 1979, Wielandt raised the problem of classifying the $ pi $ -submaximal subgroups in minimal nonsolvable groups. Some solution to this problem is known for the...     

The Number of Irreducible Character Degrees of Solvable Groups Satisfying the One-Prime Hypothesis

Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We say G satisfies the one-prime hypothesis if whenever a and b are distinct degrees in cd(G), then the greatest common divisor of a and b is either 1 or a prime. We show that if G is a solvable group satisfying the one-prime hypothesis, then |cd(G)|≤9. We also construct a solvable group G satisfying the one-prime hypothesis with |cd(G)|=9 which shows that the bound found in this paper is the best possible bound. Presented by D. Passman Mathematics Subject Classification (2000) 20C15.     

Finite Groups with Nonmonomial Characters of Prime Degree

It is proved that every finite group for which the degrees of its nonmonomial characters are primes is solvable. The proof uses the classification of the finite simple groups.