2020
DOI: 10.48550/arxiv.2003.02620
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Symmetric Function Theory and Unitary Invariant Ensembles

Bhargavi Jonnadula,
Jonathan P. Keating,
Francesco Mezzadri

Abstract: Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices drawn from the Circular Unitary Ensemble and other Circular Ensembles related to the classical compact groups. The reason is that they enable the derivation of exact formulae, which then provide a route to calculating the large-matrix asymptotics of these quantities. We develop … Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…For Hermitian ensembles, Jonnadula, Keating, and Mezzadri [99,100] proved a version of proposition 3.9 using multivariate orthogonal polynomials. They subsequently calculated the asymptotics of the moments of the associated characteristic polynomials, and , in the GUE case, identified a subtle dependence on the parity of the matrix size.…”
Section: Definition 319 (Symplectic Patterns)mentioning
confidence: 99%
“…For Hermitian ensembles, Jonnadula, Keating, and Mezzadri [99,100] proved a version of proposition 3.9 using multivariate orthogonal polynomials. They subsequently calculated the asymptotics of the moments of the associated characteristic polynomials, and , in the GUE case, identified a subtle dependence on the parity of the matrix size.…”
Section: Definition 319 (Symplectic Patterns)mentioning
confidence: 99%
“…µ form a basis for symmetric polynomials of degree |µ|. The Schur polynomials can be expanded as [35]…”
Section: Young Diagram Of µmentioning
confidence: 99%
“…As noticed in the previously cited papers, after the proper rescaling to set N − k variables to 1, one ends up with g λ (x) = S λ x + 1 N −1 . Determinantal manipulations often use the minor expansion used in remark 4.26, itself equivalent to the partial fraction expansion of t → H[tX] or t → H[t(X − Y )] given in (161), but to perform an asymptotic analysis, it is better suited to use an integral form coming from a residue sum ; in our setting, this means going from (162) to (159). Such a manipulation is for instance done in [146, (3), (4)] starting from the residue sum of [228,Prop.…”
Section: Asymptotic Representation Theorymentioning
confidence: 99%
“…On the other hand, formula (22) and the underlying philosophy of proof can be extended in a straightforward way to the orthogonal and symplectic circular ensembles with a zonal polynomial or more generally to circular β ensembles, replacing the Schur function by a Jack polynomial expansion (see § 3.3). In fact, the philosophy could also be applied to any ensemble, if one defines the correct equivalent of rectangular Schur function as in [159], and it could even be generalised to other random variables associated to more general symmetric functions such as the Hall-Littlewood ones (see remark 3.1).…”
mentioning
confidence: 99%