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
The finite groups with thirteen and fourteen conjugacy classes
✍ Scribed by A. Vera–López; Josu Sangroniz
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 250 KB
- Volume
- 280
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Up to isomorphism, there are only finitely many finite groups with a given number of conjugacy classes. Those with up to twelve classes have already been classified. In this work we extend the classification to thirteen and fourteen classes. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
The conjugacy classes of the finite general linear and unitary groups are used to define probability measures on the set of all partitions of all natural numbers. Probabilistic algorithms for growing random partitions according to these measures are obtained. These algorithms are applied to prove gr
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
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