Random matrix theory over finite fields

Bulletin of the American Mathematical Society

Volumn 39, Issue 1, 2002, Pages 51-85

  Fulman, Jason ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035997404     PISSN: 02730979     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0273-0979-01-00920-X     Document Type: Article

References (111)

1. Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem
2. Multiple series Rogers-Ramanujan type identities
3. On the proofs of the Rogers-Ramanujan identities
4. On random polynomials over finite fields
5. On the maximal subgroups of the finite classical groups
6. Identities of the Rogers-Ramanujan type
7. Ramanujan's identities in statistical mechanics
8. The character of the infinite wedge representation
9. The rank of sparse random matrices over finite fields
10. The law of large numbers and the central limit theorem for the Jordan normal form of large triangular matrices over a finite field
11. Asymptotics of Plancherel measures for symmetric groups
12. Harmonic functions on multiplicitive graphs and interpolation polynomials
13. A constructive recognition algorithm for the special linear group
14. Generating random elements of a finite group
15. The asymptotic probability that a random biased matrix is invertible
16. On the number of homomorphisms from a finite group to a general linear group
17. An affine walk on the hypercube
18. Riffle shuffle, cycles, and descents
19. Mirror symmetry and elliptic curves
20. On some problems of statistical group theory. I
21. The sampling theory of selectively neutral alleles
22. Coinvariants of nilpotent subalgebras of the Virasoro algebra and partition identities
23. The probability that a matrix be nilpotent
24. Groups and computation II
25. The number of regular semisimple elements for Chevalley groups of classical type
26. Cycle indices of linear, affine, and projective groups
27. Random generation of linear codes
28. The structure of random partitions of large integers
29. Cycle indices for the finite classical groups
30. A probabilistic approach to conjugacy classes in the finite general linear and unitary groups
31. The Rogers-Ramanujan identities, the finite general linear groups, and the Hall-Littlewood polynomials
32. The eigenvalue distribution of a random unipotent matrix in its representation on lines
33. A probabilistic approach to conjugacy classes in the finite symplectic and orthogonal groups
34. A probabilistic proof of the Rogers-Ramanujan identities
35. Finite affine groups: Cycle indices, symmetric functions, and probabilistic algorithms
36. Applications of the Brauer complex: Card-shuffling, permutation statistics, and dynamical systems
37. A random q, t-hook walk and a sum of Pieri coefficients
38. A central limit theorem on GL(n, q)
39. Du domaine d'analyse combinatoire
40. A combinatorial generalization of the Rogers-Ramanujan identities
41. The proportion of p-singular elements in simple groups of Lie type
42. How random is the characteristic polynomial of a random matrix?
43. On the probability that a group element is p-singular
44. Conjugacy in groups of upper triangular matrices
45. Discrete orthogonal polynomial ensembles and the Plancherel measure
46. Random matrix theory and ζ(1/2 + it)
47. The boundary of Young lattice and random Young tableaux
48. Generalized Hall-Littlewood symmetric functions and orthogonal polynomials
49. Combinatorial examples in AF-algebras, differential geometry, Lie groups and mechanics X
50. The boundary of Young graph with Jack edge multiplicities
51. Random partitions in population genetics
52. Variations on the triangular theme
53. The art of computer programming
54. The cycle structure of a linear transformation over a finite field
55. The cohomology of the regular semisimple variety
56. Homology stability for classical regular semisimple varieties
57. The probability of generating a finite simple group
58. Simple groups, permutation groups, and probability
59. The product replacement algorithm and Kazhdan's property (T)
60. A current view of random number generators
61. Matrices and the structure of random number sequences
62. A recognition algorithm for special linear groups
63. Cyclic matrices over finite fields
64. Derangements and eigenvalue-free elements in finite classical groups
65. Cyclic matrices and the meataxe
66. Cyclic matrices in classical groups over finite fields
67. A recognition algorithm for classical groups over finite fields
68. What do we know about the product replacement algorithm?
69. Asymptotic results for permutation groups
70. Asymptotic results for simple groups and some applications
71. Group enumeration and where it leads us
72. Second memoir on the expansion of certain infinite products
73. The order of a typical matrix with entries in a finite field
74. A theorem on random matrices and some applications
75. Probabilistic group theory
76. Asymptotic group theory
77. Ordered cycle lengths in a random permutation
78. Identities of Euler and finite classical groups
79. Universality at the edge of the spectrum in Wigner random matrices
80. Regular elements of semisimple algebraic groups
81. Some asymptotic results on finite vector spaces
82. The average order of a matrix
83. Die unzerlegbaren, positiv-definiten Klassenfunktionen der abtahlbar unendlichen, symmetrischen Gruppe
84. Some algorithms for the calculation of conjugacy classes in the Sylow p-subgroups of GL(n, q)
85. On the number of conjugacy classes of the Sylow p-subgroups of GL(n, q)
86. Limit measures arising in the asymptotic theory of the symmetric group
87. On conjugacy classes in the unitary, symplectic, and orthogonal groups
88. Counting cyclic and separable matrices over a finite field