A Bound on the Number of Conjugacy Classes of a Finite Soluble Group (Q3729150)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3961941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Bound on the Number of Conjugacy Classes of a Finite Soluble Group |
scientific article; zbMATH DE number 3961941 |
Statements
A Bound on the Number of Conjugacy Classes of a Finite Soluble Group (English)
0 references
1987
0 references
number of conjugacy classes
0 references
finite nilpotent group
0 references
finite soluble group
0 references
soluble primitive permutation groups
0 references
primitive linear groups
0 references
0.97164357
0 references
0 references
0.9487848
0 references
0.9476938
0 references
0 references
0.9410609
0 references
0.9405092
0 references
0.93468046
0 references
0 references
Let k(G) denote the number of conjugacy classes of the (finite) group G, and let \(k_ G(N)\) be the number of G-conjugacy classes comprising its normal subgroup N. It is known that a finite group G of order t satisfies the inequality k(G)\(\geq \log \log t\) (the logarithm being to base 2). It is also known that a finite nilpotent group G of order t satisfies k(G)\(\geq \log t.\) It is suspected that a logarithmic bound holds in general, but such a bound has been demonstrated only for groups which are ''almost nilpotent''. In this paper we prove the existence of constants a and b such that any finite soluble group G of order t has k(G)\(\geq a(\log t)^ b.\) The proof proceeds in several steps. Well-known reduction theorems are used to reduced the core of the problem to questions about soluble primitive permutation groups and primitive linear groups; these are combined with some techniques of handling nilpotent normal subgroups, from a previous paper, to give the result quoted. The proof yields an estimate of b: namely, for a suitable value of a, b can be given any value less than 0.00347... En route to this result, we produce an upper bound to the class number of a group G, in terms of the number of classes of a normal subgroup \(N: k(G)\leq | G:N| k_ G(N)\). More generally, if M, N are normal subgroups of G with \(M\geq N\), then \(k_ G(M)\leq | M:N| k_ G(N)\).
0 references