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

Asymptotic expansion of Toeplitz determinants of an indicator function with discrete rotational symmetry and powers of random unitary matrices

Abstract: In this short article we propose a full large N asymptotic expansion of the probability that the m th power of a random unitary matrix of size N has all its eigenvalues in a given arc-interval centered in 1 when N is large. This corresponds to the asymptotic expansion of a Toeplitz determinant whose symbol is the indicator function of several intervals having a discrete rotational symmetry. This solves and improves a conjecture left opened by the author in [29]. It also provides a rare example of the explicit … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…The problem of determining large gap asymptotics is a notoriously difficult problem in random matrix theory with a long history [39,41,50]. There have been several methods that have proven successful to solve large gap problems of one-dimensional point processes, among which: the Deift-Zhou [25] steepest descent method for Riemann-Hilbert problems [10,18,19,22,24,[27][28][29]49], operator theoretical methods [33,34,75], the "loop equations" [15,16,56,57], and the Brownian carousel [31,64,72,73].…”
Section: Methods Of Proofmentioning
confidence: 99%
“…The problem of determining large gap asymptotics is a notoriously difficult problem in random matrix theory with a long history [39,41,50]. There have been several methods that have proven successful to solve large gap problems of one-dimensional point processes, among which: the Deift-Zhou [25] steepest descent method for Riemann-Hilbert problems [10,18,19,22,24,[27][28][29]49], operator theoretical methods [33,34,75], the "loop equations" [15,16,56,57], and the Brownian carousel [31,64,72,73].…”
Section: Methods Of Proofmentioning
confidence: 99%