Strong Asymptotics of the Orthogonal Polynomials with Respect to a Measure Supported on the Plane
Bibliographic record
Abstract
We consider the orthogonal polynomials with respect to the measure urn:x-wiley::media:cpa21541:cpa21541-math-0002 over the whole complex plane. We obtain the strong asymptotic of the orthogonal polynomials in the complex plane and the location of their zeros in a scaling limit where n grows to infinity with N. The asymptotics are described in terms of three (probability) measures associated with the problem. The first measure is the limit of the counting measure of zeros of the polynomials, which is captured by the g‐function much in the spirit of ordinary orthogonal polynomials on the real line. The second measure is the equilibrium measure that minimizes a certain logarithmic potential energy, supported on a region K of the complex plane. The third measure is the harmonic measure of Kc with a pole at ∞. This appears as the limit of the probability measure given (up to the normalization constant) by the squared modulus of the nth orthogonal polynomial times the orthogonality measure, i.e., The compact region K that is the support of the second measure undergoes a topological transition under the variation of the parameter in a double scaling limit near the critical point given by we observe the Hastings‐McLeod solution to Painlevé II in the asymptotics of the orthogonal polynomials. © 2014 Wiley Periodicals, Inc.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".