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...
Główni autorzy: | Hambly, B, Keevash, P, O'Connell, N, Stark, D |
---|---|
Format: | Journal article |
Język: | English |
Wydane: |
2000
|
Podobne zapisy
-
Frankl-Rödl-type theorems for codes and permutations
od: Keevash, P, i wsp.
Wydane: (2016) -
Further results on permutation polynomials and complete permutation polynomials over finite fields
od: Qian Liu, i wsp.
Wydane: (2021-09-01) -
On permutation polynomials over finite fields
od: R. A. Mollin, i wsp.
Wydane: (1987-01-01) -
Permutation Polynomial Interleaved DFT-s-OFDM
od: Fredrik Berggren, i wsp.
Wydane: (2023-01-01) -
Tree enumeration polynomials on separable permutations
od: Yibo Gao, i wsp.
Wydane: (2023-08-01)