اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGap Probabilities in the Laguerre Unitary Ensemble and Discrete Painleve Equations
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we study a certain recurrence relation, that can be used to generate ladder operators for the Laguerre Unitary ensemble, from the point of view of Sakais geometric theory of Painleve equations. On one hand, this gives us one more detailed example of the appearance of discrete Painleve equations in the theory of orthogonal polynomials. On the other hand, it serves as a good illustration of the effectiveness of a recently proposed procedure on how to reduce such recurrences to some canonical discrete Painleve equations.
قيم البحث
اقرأ أيضاً
Over the last decade it has become clear that discrete Painleve equations appear in a wide range of important mathematical and physical problems. Thus, the question of recognizing a given non-autonomous recurrence as a discrete Painleve equation and
determining its type according to Sakais classification scheme, understanding whether it is equivalent to some known (model) example, and especially finding an explicit change of coordinates transforming it to such an example, becomes one of the central ones. Fortunately, Sakais geometric theory provides an almost algorithmic procedure for answering this question. In this paper we illustrate this procedure by studying an example coming from the theory of discrete orthogonal polynomials. There are many connections between orthogonal polynomials and Painleve equations, both differential and discrete. In particular, often the coefficients of three-term recurrence relations for discrete orthogonal polynomials can be expressed in terms of solutions of discrete Painleve equations. In this work we study discrete orthogonal polynomials with general hypergeometric weight and show that their recurrence coefficients satisfy, after some change of variables, the standard discrete Painleve-V equation. We also provide an explicit change of variables transforming this equation to the standard form.
The classical Painleve equations are so well known that it may come as a surprise to learn that the asymptotic description of its solutions remains incomplete. The problem lies mainly with the description of families of solutions in the complex domai
n. Where asymptotic descriptions are known, they are stated in the literature as valid for large connected domains, which include movable poles of families of solutions. However, asymptotic analysis necessarily assumes that the solutions are bounded and so these domains must be punctured at locations corresponding to movable poles, leading to asymptotic results that may not be uniformly valid. To overcome these issues, we recently carried out asymptotic analysis in Okamotos geometric space of initial values for the first and second Painleve equations. In this paper, we review this method and indicate how it may be extended to the discrete Painleve equations.
Discrete Painleve equations are nonlinear, nonautonomous difference equations of second-order. They have coefficients that are explicit functions of the independent variable $n$ and there are three different types of equations according to whether th
e coefficient functions are linear, exponential or elliptic functions of $n$. In this paper, we focus on the elliptic type and give a review of the construction of such equations on the $E_8$ lattice. The first such construction was given by Sakai cite{SakaiH2001:MR1882403}. We focus on recent developments giving rise to more examples of elliptic discrete Painleve equations.
In this paper a comprehensive review is given on the current status of achievements in the geometric aspects of the Painleve equations, with a particular emphasis on the discrete Painleve equations. The theory is controlled by the geometry of certain
rational surfaces called the spaces of initial values, which are characterized by eight point configuration on $mathbb{P}^1timesmathbb{P}^1$ and classified according to the degeration of points. We give a systematic description of the equations and their various properties, such as affine Weyl group symmetries, hypergeomtric solutions and Lax pairs under this framework, by using the language of Picard lattice and root systems. We also provide with a collection of basic data; equations, point configurations/root data, Weyl group representations, Lax pairs, and hypergeometric solutions of all possible cases.
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its explicit form and show some examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
