On the number of conjugacy classes of a finite solvable group. II. (Q1421791): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5634146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solvable Primitive Permutation Groups of Low Rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On The Number of Conjugacy Classes of a Finite Solvable Group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Endliche Gruppen I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273959 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Character correspondence and p-blocks of P-solvable groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank of a finite primitive solvable permutation group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of finite groups according to the number of conjugacy classes. II / rank | |||
Normal rank |
Latest revision as of 14:32, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of conjugacy classes of a finite solvable group. II. |
scientific article |
Statements
On the number of conjugacy classes of a finite solvable group. II. (English)
0 references
3 February 2004
0 references
[For part I see Bull. Lond. Math. Soc. 32, No. 6, 668-672 (2000; Zbl 1024.20016).] This paper proves the following theorem: Let \(G\) be a finite soluble group and let \(p\) be a prime where \(p^2\) divides the order of \(G\). Then \(G\) has at least \((49p+1)/60\) conjugacy classes. Since we know that the number of conjugacy classes is the same as the number of irreducible characters, the same result applies to the number of irreducible characters. The authors use this fact and really prove it in that form. A key result is the observation that the Alperin-McKay conjecture holds for soluble groups [\textit{T. Okuyama} and \textit{M. Wajima}, Osaka J. Math. 17, 801-806 (1980; Zbl 0446.20003)]. This enables the authors to use induction and show that they need only consider the case where the Sylow \(p\)-subgroup is a normal elementary Abelian subgroup of \(G\) and \(O_{p'}(G)=1\).
0 references
finite soluble groups
0 references
numbers of conjugacy classes
0 references