A Graph Related to Conjugacy Classes of Solvable Groups
โ Scribed by G. Alfandary
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 247 KB
- Volume
- 176
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods, one obtains a probabilistic proof of Steinberg's count of unipotent matrices and generalizations of
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
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