A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
| dc.creator | Fulman, Jason | |
| dc.date | 2000-03-02 | |
| dc.date | 2000-11-06 | |
| dc.date.accessioned | 2026-07-07T04:34:10Z | |
| dc.date.available | 2026-07-07T04:34:10Z | |
| dc.description | 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. | |
| dc.description | Revised version; to appear in J. Algebra. Same results. We fix a possibly misleading typo, replacing u by u^2 in some normalization constants | |
| dc.identifier | https://arxiv.org/abs/math/0003010 | |
| dc.identifier | http://arxiv.org/abs/math/0003010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/58797 | |
| dc.subject | Group Theory | |
| dc.subject | Probability | |
| dc.title | A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups | |
| dc.type | text |