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...
Κύριοι συγγραφείς: | Hambly, B, Keevash, P, O'Connell, N, Stark, D |
---|---|
Μορφή: | Journal article |
Γλώσσα: | English |
Έκδοση: |
2000
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Frankl-Rödl-type theorems for codes and permutations
ανά: Keevash, P, κ.ά.
Έκδοση: (2016) -
On permutation polynomials over finite fields
ανά: R. A. Mollin, κ.ά.
Έκδοση: (1987-01-01) -
Permutation Polynomial Interleaved DFT-s-OFDM
ανά: Fredrik Berggren, κ.ά.
Έκδοση: (2023-01-01) -
Tree enumeration polynomials on separable permutations
ανά: Yibo Gao, κ.ά.
Έκδοση: (2023-08-01) -
Pitman's 2M - X theorem for skip-free random walks with Markovian increments
ανά: Hambly, B, κ.ά.
Έκδοση: (2001)