A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
Revised version; to appear in J. Algebra. Same results. We fix a possibly misleading typo, replacing u by u^2 in some normalization constants

Keywords

Group Theory, Probability

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/58797

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0003010
 http://arxiv.org/abs/math/0003010

Collections

arXiv