A probabilistic approach to conjugacy classes in the finite symplectic and orthogonal groups

[摘要] 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. (C) 2000 Academic Press.

[发布日期] 2000-12-01

[关键词] conjugacy class;eigenvalue;random matrix;classical group;Markov chain