2016
DOI: 10.1007/s10208-016-9313-0
|View full text |Cite
|
Sign up to set email alerts
|

Do Orthogonal Polynomials Dream of Symmetric Curves?

Abstract: Abstract. The complex or non-Hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the freedom in the choice of the integration contour for such polynomials, the location of their zeros is a priori not clear. Nevertheless, numerical experiments, such as those presented in this paper, show that the zeros not simply cluster somewhere on the plane, but persis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 69 publications
0
10
0
Order By: Relevance
“…The problem of existence of the S-contour, not only in the context of Gonchar and Rakhmanov's original work but also in other contexts, remained open until not so long ago, when Rakhmanov [38] outlined a very general max-min approach for obtaining S-contours. The rigorous analysis of this approach, nowadays called the Gonchar-Rakhmanov-Stahl program, depends heavily on the type of orthogonality weight and the geometry of the contours at hand, but nevertheless has been carried out in various different settings [5,28,31,33,44], many of which were largely inspired by Rakhmanov's outline in [38].…”
Section: Statement Of Main Resultsmentioning
confidence: 99%
“…The problem of existence of the S-contour, not only in the context of Gonchar and Rakhmanov's original work but also in other contexts, remained open until not so long ago, when Rakhmanov [38] outlined a very general max-min approach for obtaining S-contours. The rigorous analysis of this approach, nowadays called the Gonchar-Rakhmanov-Stahl program, depends heavily on the type of orthogonality weight and the geometry of the contours at hand, but nevertheless has been carried out in various different settings [5,28,31,33,44], many of which were largely inspired by Rakhmanov's outline in [38].…”
Section: Statement Of Main Resultsmentioning
confidence: 99%
“…We see that this distinction between the one and two cut regimes will also play a fundamental role in the present analysis, as hinted at by Figure 2. This potential‐theoretic approach, known now as the Gonchar–Rakhmanov–Stahl (GRS) program, has been carried out in various scenarios, and we refer the reader to many excellent works on the subject 24,31–37 …”
Section: Statement Of Main Resultsmentioning
confidence: 99%
“…This potential-theoretic approach, known now as the Gonchar-Rakhmanov-Stahl (GRS) program, has been carried out in various scenarios, and we refer the reader to many excellent works on the subject. 24,[31][32][33][34][35][36][37] Despite many successful applications of potential theory to the analysis of non-Hermitian orthogonal polynomials via the GRS program, we adopt an alternate viewpoint based on deformation techniques born from advances in the theory of random matrices and integrable systems. We will make heavy use of the technique known as continuation in parameter space, first developed in the context of integrable systems (cf.…”
Section: Statement Of Main Resultsmentioning
confidence: 99%
“…In most cases such a compact exists and unique but there are exceptions and it is often not easy to establish fact of existence. In some cases existence may be proved by max-min energy problem (see [34], [30], [25], [36], [31], [32], [27]) which we discuss later in connection with our current problem (31). Anyway, situation is essentially simplified if existence of an S-compact set is known.…”
Section: Grs Theoremmentioning
confidence: 99%