zbMATH — the first resource for mathematics

Character degree graphs that are complete graphs. (English) Zbl 1112.20006
Let \(G\) be a finite group and let \(\text{cd}(G)\) denote the different integers which occur as the degrees of the irreducible complex characters of \(G\). Let \(\Gamma(G)\) be the graph whose vertex set is \(\text{cd}(G)-\{1\}\). An edge joins two vertices represented by positive integers \(a\) and \(b\) if \(\gcd(a,b)>1\).
The authors prove that if \(\Gamma(G)\) is a complete graph, then \(G\) is solvable.
The proof, as might be anticipated, uses the classification of finite simple groups, and divides itself into three parts. For groups of Lie type, properties of the Steinberg character are used. For alternating groups, two irreducible characters whose degrees are small and relatively prime, and which extend to the symmetric group, are used. For sporadic groups, pairs of irreducible characters of relatively prime degrees, which also extend to the relevant automorphism group, are employed. These are found using the ATLAS.

20C15 Ordinary representations and characters
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
20D60 Arithmetic and combinatorial problems involving abstract finite groups
Full Text: DOI
[1] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, Atlas of finite groups, Oxford University Press, Eynsham, 1985. Maximal subgroups and ordinary characters for simple groups; With computational assistance from J. G. Thackray. · Zbl 0568.20001
[2] Yakov Berkovich, Finite groups with small sums of degrees of some non-linear irreducible characters, J. Algebra 171 (1995), no. 2, 426 – 443. · Zbl 0829.20011 · doi:10.1006/jabr.1995.1020 · doi.org
[3] Roger W. Carter, Finite groups of Lie type, Pure and Applied Mathematics (New York), John Wiley & Sons, Inc., New York, 1985. Conjugacy classes and complex characters; A Wiley-Interscience Publication. · Zbl 0567.20023
[4] Bertram Huppert, Character theory of finite groups, De Gruyter Expositions in Mathematics, vol. 25, Walter de Gruyter & Co., Berlin, 1998. · Zbl 0932.20007
[5] I. Martin Isaacs, Character theory of finite groups, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1976. Pure and Applied Mathematics, No. 69. · Zbl 0337.20005
[6] I. M. Isaacs, Character correspondences in solvable groups, Adv. in Math. 43 (1982), no. 3, 284 – 306. · Zbl 0487.20004 · doi:10.1016/0001-8708(82)90037-8 · doi.org
[7] Mark L. Lewis, Alexander Moret√≥, and Thomas R. Wolf, Non-divisibility among character degrees, J. Group Theory 8 (2005), no. 5, 561 – 588. · Zbl 1097.20011 · doi:10.1515/jgth.2005.8.5.561 · doi.org
[8] M. L. LEWIS, An overview of graphs associated with character degrees and conjugacy class sizes in finite groups, to appear in Rocky Mountain J. Math. · Zbl 1166.20006
[9] John K. McVey, Bounding graph diameters of nonsolvable groups, J. Algebra 282 (2004), no. 1, 260 – 277. · Zbl 1070.20009 · doi:10.1016/j.jalgebra.2004.08.019 · doi.org
[10] Peter Schmid, Rational matrix groups of a special type, Linear Algebra Appl. 71 (1985), 289 – 293. · Zbl 0575.20005 · doi:10.1016/0024-3795(85)90255-1 · doi.org
[11] Peter Schmid, Extending the Steinberg representation, J. Algebra 150 (1992), no. 1, 254 – 256. · Zbl 0794.20022 · doi:10.1016/S0021-8693(05)80060-2 · doi.org
[12] Alexandre Turull, Generic fixed point free action of arbitrary finite groups, Math. Z. 187 (1984), no. 4, 491 – 503. · Zbl 0574.20013 · doi:10.1007/BF01174184 · doi.org
[13] Donald L. White, Degree graphs of simple groups of exceptional Lie type, Comm. Algebra 32 (2004), no. 9, 3641 – 3649. · Zbl 1077.20013 · doi:10.1081/AGB-120039635 · doi.org
[14] D. L. WHITE, Degree graphs of simple linear and unitary groups, to appear in Comm. Algebra. · Zbl 1105.20007
[15] D. L. WHITE, Degree graphs of simple orthogonal and symplectic groups, to appear in J. Algebra. · Zbl 1145.20007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.