𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A Probabilistic Approach Toward Conjugac
✍ Jason Fulman πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 205 KB

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

The finite groups with thirteen and four
✍ A. Vera–LΓ³pez; Josu Sangroniz πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 250 KB

## 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

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