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
A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
β Scribed by Jason Fulman
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 135 KB
- Volume
- 234
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
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 formulas of Rudvalis and Shinoda.
π SIMILAR VOLUMES
## 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, Wei
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