Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 154 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 36 tok/s Pro
GPT-4o 109 tok/s Pro
Kimi K2 206 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 39 tok/s Pro
2000 character limit reached

Asymptotics of orthogonal polynomials with complex varying quartic weight: global structure, critical point behaviour and the first Painleve' equation (1108.0321v2)

Published 1 Aug 2011 in nlin.SI, math-ph, and math.MP

Abstract: We study the asymptotics of recurrence coefficients for monic orthogonal polynomials p_n(z) with the quartic exponential weight exp [-N (1/2 z2 + t/4 z4)], where t is complex. Our goals are: A) to describe the regions of different asymptotic behaviour (different genera) globally in t; B) to identify all the critical points, and; C) to study in details the asymptotics in a full neighborhood near of critical points (double scaling limit), including at and near the poles of Painleve' I solutions y(v) that are known to provide the leading correction term in this limit. Our results are: A) We found global (in t) asymptotic of recurrence coefficients and of "square-norms" for the orthogonal polynomials for different configurations of the contours of integration. Special code was developed to analyze all possible cases. B) In addition to the known critical point t_0=- 1/ 12, we found new critical points t_1=1/15 and t_2=1/4. C) We derived the leading order behavior of the recurrence coefficients (together with the error estimates) at and around the poles of y(v) near the critical points t_0,t_1 in what we called the triple scaling limit. We proved that the recurrence coefficients have unbounded "spikes" near the poles of y(v) and calculated the "universal" shape of these spikes for different cases. The nonlinear steepest descent method for Riemann-Hilbert Problem (RHP) is the main technique used in the paper. We note that the RHP near the critical points is very similar to the RHP describing the semiclassical limit of the focusing NLS near the point of gradient catastrophe that the authors solved previously.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.