𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds for the Number of Conjugacy Classes of a Finite Group

✍ Scribed by Martin W. Liebeck; László Pyber


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
315 KB
Volume
198
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


For a finite group G, let k G denote the number of conjugacy classes of G. We prove that a simple group of Lie type of untwisted rank l over the field of q Ž . l elements has at most 6 q conjugacy classes. Using this estimate we show that for Ž . Ž .

10 n completely reducible subgroups G of GL n, q we have k G F q , confirming a Ž . conjecture of Kovacs and Robinson. For finite groups G with F* G a p-group we Ž . Ž . a a prove that k G F cp where p is the order of a Sylow p-subgroup of G and c Ž . Ž . < < X is a constant. For groups with O G s 1 we obtain that k G F G . This latter p p result confirms a conjecture of Iranzo, Navarro, and Monasor. We also improve various earlier results concerning conjugacy classes of permutation groups and linear groups. As a by-product we show that any finite group G has a soluble Ž . < < Ž . < < 3 subgroup S and a nilpotent subgroup N such that k G F S and k G F N .


📜 SIMILAR VOLUMES


On the Number of Conjugacy Classes of π-
✍ Burkhard Külshammer; Geoffrey R. Robinson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Let G be a finite group and a set of primes. In this note we will prove Ž . two results on the local control of k G, , the number of conjugacy w x classes of -elements in G. Our results will generalize earlier ones in 8 , w x w x 9 , and 3 . Ž . Ž . In the following, we denote by F F G the poset of

Groups with a Bounded Number of Conjugac
✍ Roberta La Haye; Akbar Rhemtulla 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Let ν G denote the number of conjugacy classes of non-normal subgroups of a group G We prove that if G is a finite group and ν G = 0 then there is a cyclic subgroup C of prime power order contained in the centre of G such that the order of G/C is a product of at most ν G + 1 primes. We also obtain a

An upper bound for the harmonious chroma
✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o

An upper bound for the k-domination numb
✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).