arXiv · math/0003010
A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jason Fulman. 2000-11-06. A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups. https://searcharxiv.com/abs/math/0003010
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.