اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn some classes of discrete polynomials and ordinary difference equations
170
0
0.0
(
0
)
تأليف
Andrei K. Svinin
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We consider two infinite classes of ordinary difference equations admitting Lax pair representation. Discrete equations in these classes are parameterized by two integers $kgeq 0$ and $sgeq k+1$. We describe the first integrals for these two classes
in terms of special discrete polynomials. We show an equivalence of two difference equations belonged to different classes corresponding to the same pair $(k, s)$. We show that solution spaces $mathcal{N}^k_s$ of different ordinary difference equations with fixed value of $s+k$ are organized in chain of inclusions.
This note is designed to show some classes of differential-difference equations admitting Lax representation which generalize evolutionary equations known in the literature.
We show some classes of higher order partial difference equations admitting a zero-curvature representation and generalizing lattice potential KdV equation. We construct integrable hierarchies which, as we suppose, yield generalized symmetries for ob
tained class of partial difference equations. As a byproduct we also derive non-evolutionary differential-difference equations with their Lax pair representation which may be of potential interest.
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.
We introduce two classes of homogeneous polynomials and show their role in constructing of integrable hierarchies for some integrable lattices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
