The characteristic polynomial of a random permutation matrix
We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. We relate this result to a central limit theorem of Wieand for the counting function for the eigenvalues lying in some interval on the unit circle. © 2000 Elsevier Science B.V. All...
Main Authors: | Hambly, B, Keevash, P, O'Connell, N, Stark, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2000
|
Similar Items
-
Frankl-Rödl-type theorems for codes and permutations
by: Keevash, P, et al.
Published: (2016) -
On permutation polynomials over finite fields
by: R. A. Mollin, et al.
Published: (1987-01-01) -
Permutation Polynomial Interleaved DFT-s-OFDM
by: Fredrik Berggren, et al.
Published: (2023-01-01) -
Tree enumeration polynomials on separable permutations
by: Yibo Gao, et al.
Published: (2023-08-01) -
Pitman's 2M - X theorem for skip-free random walks with Markovian increments
by: Hambly, B, et al.
Published: (2001)