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
✦ LIBER ✦
On finite groups isospectral to simple symplectic and orthogonal groups
✍ Scribed by A. V. Vasil’ev; M. A. Grechkoseeva; V. D. Mazurov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2009
- Tongue
- English
- Weight
- 293 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0037-4466
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Probabilistic Approach to Conjugacy Cl
✍
Jason Fulman
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 135 KB
Minimal permutation representations of f
✍
V. D. Mazurov
📂
Article
📅
1993
🏛
Springer US
🌐
English
⚖ 702 KB
Integration with Respect to the Haar Mea
✍
Benoît Collins; Piotr Śniady
📂
Article
📅
2006
🏛
Springer
🌐
English
⚖ 311 KB
On Classifying All Full Factorisations a
✍
Robert W Baddeley; Cheryl E Praeger
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 560 KB
We present some general results on factorisations of almost simple groups. These results are consequences of the classification of all maximal factorisations of Ž . almost simple groups due to Liebeck, Saxl, and the second author , and are needed for applications to the theory of quasiprimitive perm
On the action of finite simple groups of
✍
Yoav Segev
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 837 KB
On the additive groups of finite near in
✍
Steve Ligh
📂
Article
📅
1972
🏛
Springer Vienna
🌐
English
⚖ 280 KB