Random matrix theory over finite fields
- 5 October 2001
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 39 (1) , 51-85
- https://doi.org/10.1090/s0273-0979-01-00920-x
Abstract
The first part of this paper surveys generating functions methods in the study of random matrices over finite fields, explaining how they arose from theoretical need. Then we describe a probabilistic picture of conjugacy classes of the finite classical groups. Connections are made with symmetric function theory, Markov chains, Rogers-Ramanujan type identities, potential theory, and various measures on partitions.Keywords
All Related Versions
This publication has 85 references indexed in Scilit:
- Cyclic Matrices in Classical Groups over Finite FieldsJournal of Algebra, 2000
- A Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal GroupsJournal of Algebra, 2000
- The Eigenvalue Distribution of a Random Unipotent Matrix in Its Representation on LinesJournal of Algebra, 2000
- The Character of the Infinite Wedge RepresentationAdvances in Mathematics, 2000
- On the Probability That a Group Element is p-SingularJournal of Algebra, 1995
- The probability of generating a finite simple groupGeometriae Dedicata, 1995
- Riffle shuffles, cycles, and descentsCombinatorica, 1995
- How random is the characteristic polynomial of a random matrix ?Mathematical Proceedings of the Cambridge Philosophical Society, 1993
- Multiple series Rogers-Ramanujan type identitiesPacific Journal of Mathematics, 1984
- On the maximal subgroups of the finite classical groupsInventiones Mathematicae, 1984