1. Introduction and Background Information
Painlevé equations form a class of second-order nonlinear differential equations with solutions that have no movable critical singularities in the complex plane, see, e.g., [
1]. Although this mathematical property motivated the discovery of Painlevé equations, these equations had an astonishing impact on several fields inside and outside mathematics in a relatively short time. A long and incomplete list of affected topics and models includes correlation functions of the Ising model, random matrix theory, plasma physics, nonlinear waves, quantum gravity, quantum field theory, general relativity, nonlinear and fiber optics, and Bose–Einstein condensation. Special solutions, such as rational solutions, turned out to be important in these applications, and various methods were applied in their study. To provide a systematic approach to the study of rational solutions, we here utilize the dressing chain and its connection to Painlevé equations. The dressing chain was derived by applying Darboux transformations to the spectral problem of second order differential equations [
2]. Specifically, let us consider a sequence of second order differential operators
connected via first order Darboux transformations:
, where
is a constant. Such symmetry is realized for
with
defined by products of two first order differential operators with their orders being interchanged when going from
n to
. Comparing the two alternative expressions for
in Equation (
1), we obtain the nonlinear lattice equations [
2]:
made finite by imposing the periodic boundary condition
. We refer to system (
2) as a system of dressing chain equations of
N-periodicity. Such a system possesses many important properties. For
, it has been shown [
2] that it passes the Kovalevskaya–Painlevé test, and its equivalence to the Painlevé IV equation has also been established [
2,
3]. For higher
N, the system is equivalent to
invariant Painlevé equations [
3,
4], and this equivalence will be utilized in this paper to construct and study rational solutions of Painlevé equations in the context of underlying periodic dressing chains. Quite recently the
N cyclic dressing chain was also obtained in the self-similarity limit of the second flow of
mKdV hierarchy [
5].
As we will now show, the system (
2) requires different treatments depending on whether
N is odd or even. This becomes evident when we consider a regular sum
and an alternating sum
of derivatives of
. Calculating a regular sum using the dressing Equation (
2) we obtain the same expression for both even and odd
N
for the integration constant on the right hand side. As long as
N is odd, calculating an alternating sum
using the dressing Equation (
2) will reproduce the same condition as in (
3). For even
N, the alternating sum
is identically zero (positive and negative terms simply cancel). However the same expression calculated by plugging the right hand side of dressing Equation (
2) yields for, e.g.,
, the expression
. Thus, the dressing chains of even periodicity require imposition of a new quadratic constraint or modification of the dressing chain formulation. Such modification was proposed in [
6], where the authors put forward a system of dressing chain equations of even
periodicity defined as:
where
This structure is such that both regular and alternating sums of derivatives of
give consistent answers when applied to the system (
4):
As shown in [
6], such a system can be obtained by Dirac reduction from
dressing chain (
2) of odd periodicity.
The above equations as well as quantities
and
are invariant under
Bäcklund transformations
[
3]:
when transformations (
6) are accompanied by transformations of coefficients
There are also two automorphisms
:
that keep the dressing Equation (
4) invariant.
For the redefined quantities
it holds that the corresponding sum
is unchanged. Such redefinition leads to a formal absorption of
terms so that they are no longer explicit in the dressing equations rewritten in terms of
that satisfy Equation (
2) [
6]. However, such a process introduces potential extra divergencies into an associated Sturm–Liouville problem. Throughout this paper we will work with (
4) with a constant non-zero
so that the polynomial seed solutions we will construct below will be free of divergencies.
We present the construction of rational and special function solutions for dressing chains of even periodicity. In this work, rational solutions are identified with points on the orbits of fundamental shift operators (sometimes also referred to in the literature as translations) of the extended affine Weyl group
acting on the first-order polynomial seed solutions. In particular, for the seed solutions with all components being equal to each other, the construction yields rational solutions being ratios of Umemura polynomials [
7]. The reduction procedure that yields special function solutions is outlined and is shown to reproduce rational solutions for appropriate values of the parameters of the underlying Riccati equations.
The presentation is organized as follows. In
Section 2, we obtain the first-order polynomial solutions of the dressing chain Equation (
4) with parameters
depending on one arbitrary variable and with a constant non-zero
that ensures that the solution is polynomial.
In
Section 3, we establish a connection between the dressing chain Equation (
4) and Hamiltonian formalism for
that can easily be generalized to arbitrary even
N values. Essential for establishing this connection is the ability to cast the dressing chain Equation (
4) as symmetric
-invariant Painlevé equations, such as as those given in Equations (
18) and (
A1) for
, respectively. We should point out that translating the system of equations depending on
into formalism that is expressed entirely in terms of
is possible for even
N thanks to the presence of
terms on the right hand side of Equation (
4). This is in contrast to odd
N dressing chains where
and
are always fully interchangeable. For
the Hamiltonian formalism of
Section 3 gives rise to the Painlevé V equation as briefly reviewed in
Section 3.2. The first-order polynomial solutions in the setting of Hamiltonian formalism become the algebraic solutions of [
8].
We are able to present power series expansions of Hamiltonian variables
p and
q in
Section 3.4. We show how potential divergencies of power series solutions (that cannot be absorbed in
) can be removed by appropriate Bäcklund transformations. After removing the eventual simple poles from rational solutions by acting with the Bäcklund transformations, we obtain rational solutions that are expandable in a series of positive powers of
z and can be reproduced by actions of the shift operators as shown in the next section.
In
Section 4, we derive rational solutions for
by acting with shift operators on the first-polynomial solutions (
11) and (12) to obtain all known cases listed in ref. [
9] that presented necessary and sufficient conditions for rational solutions of the Painlevé V equation. Ref. [
10] showed how to act with shift operators on solutions (
11) (expressed by tau functions) to obtain some of the cases of [
9] (items I + II in Section (
4.1)).
For the first-order polynomial seed solutions (
11) (with all the components
equal to
), the action of shift operators yields rational solutions expressed by Umemura polynomials [
7,
11] and we use the shift operators to derive the recurrence relations that determine these polynomials. Extending structure of seed solutions to include solutions (12) (where
for some
i) requires exclusion of those shift operators that are ill-defined when acting on such solutions as discussed in
Section 4.5. Those of the shift operators that are well-defined generate the remaining rational solutions from solutions (12), see item III in
Section 4.1. This new approach leads to a systematic and unified way to derive all rational Painlevé V solutions. Based on results for
we conjecture that for all even
N values all rational solutions are obtainable through actions of shift operators on first-order polynomial solutions.
In
Section 5, we provide explicit construction of special function solutions and rational solutions for
. The rational solutions are always identified with orbits of the fundamental shift operators. For the seed solution with all components being equal or only one of the components being negative, we are able to express the corresponding rational solutions by Umemura-type polynomials. Existence of special function solutions is established for the remaining cases, with a sufficient number of constraints imposed on
parameters to insure reduction of Hamiltonian equations to one single Riccati equation. For
this happens for three independent constraints. However we also encounter hybrid situations with one single Riccati equation and one coupled quadratic (in
) equations for some cases with two constraints. In such cases there exists a special function solution for only one of the variables. Interestingly, when
parameters are associated with orbits of the shift operators, we obtain closed expressions in terms of Whittaker functions that describe rational solutions for all underlying variables of the reduced system.
2. Preliminaries. The Seed Solutions as the First-Order Polynomial Solutions of Even Chains
For simplicity, we first carry out the discussion for before proceeding to the case of and making general comments about higher N cases.
We are looking for the first-order polynomial solutions to Equation (
4) of the type
that satisfy the
condition. With such ansatz, the quantity
defined in (
5) can only contain terms with
or a constant. The terms quadratic in
z can be absorbed in
via (
9) transformation. Thus, without losing any generality we can assume that
where we used that
.
One can easily see that the condition for
not to contain
for the polynomial solutions of the first-order amounts to
on the right hand side of the dressing equations. Thus, the solution must be
with
and
c a non-zero constant. Since
we must also have
. This argument eliminates the case of two epsilons being negative,
, as this would violate
. Therefore the only two independent (up to
) polynomial solutions are:
Both solutions depend on only one free parameter
. The remaining first order polynomial solutions can be obtained by acting with
, and
on solution (12) (recall that
for
cyclicity and so
). Note that in case of solution (12), the action of automorphism
is such that it simply moves the
term in expression for
and zeros in expression for
to the right. It is important to point out that there could be other potential solutions of the first-order polynomial type like for example
. However, such solutions would involve
terms in
and could be transformed by the transformation (
9) involving the
part of
to the solution (12) or its
variants.
One can easily extend this analysis to higher
N with
and
defined in the definition (
5). For the
first-order polynomial solutions we take:
and obtain five different first-order polynomial solutions:
since all these configurations seems to be distinct and can not be connected by permutation generated by
or multiples of
’s. All the above solutions depend on one arbitrary parameter
. Note that
is not a solution because it would violate the
condition. Thus the number of configurations is equal to
, where
is a number of partitions of 4 in two parts (of positive integers and zero):
. For
we find a number of the first-order polynomial solutions to be
with
and
. Generally a number of the first-order polynomial solutions is given by
, where
is a number of distinct partitions of
in
k parts consisting of positive integers and zero.
For arbitrary even
N with
,
and an arbitrary variable
, there will always be a fully symmetric solution:
which is a fixed point of
automorphism. The remaining solutions will have one and up to
negative components
with varying distance between the negative components. For example, for only one negative component in the last position we get
with
for
, and so on for solutions with more negative components.
One needs to point out that the first-order solutions (
13)–(17) appeared also as simple rational solutions expressed in terms of
that give rise to other rational solutions via Bäcklund transformations in the framework of
Painlevé equations (equivalent to
dressing chain equations) in ref. [
12].
4. Construction of Rational Solutions
In this section, we will describe a method to derive all rational solutions that are obtainable from the first-order polynomial solutions of dressing Equation (
4) via the combined actions of fundamental shift operators
from (
68).
4.1. Summary of the Results for
For
the seeds solutions (
11) and (12) of dressing Equation (
4) are equivalent to Watanabe’s algebraic solutions (
22)–(26) in the setting of Hamilton Equation (
20). It is convenient to give the classification of solutions in terms of parameters
of the dressing chain equations that define the Painlevé V parameters
via relations (
38) with
parameter being non-zero and here equal to
(for
).
The rational solutions obtained by acting with the shift operators fall into three classes of parameters , and depending on whether the fundamental shift operators act on solutions
from (
11) (items (Ia,Ib) and item (II)). In case of item (II) an intermediary step of acting with
in addition to the shift operators is involved, see f.i. Equation (
53).
from (12) (items (IIIa,IIIb)).
These three cases are as follows:
- (I)
with
and
A arbitrary. The above implies either (Ia) or (Ib):
- (Ia)
, and where is even and equal to and arbitrary,
- (Ib)
, and where is even and equal to and arbitrary
- (II)
which imply
where
A is arbitrary and
are integers.
- (IIIa)
with
A arbitrary and
that includes positive integers and zero. Accordingly, eliminating the arbitrary number
A from the above equations, we can write
where
and with
being an even integer.
- (IIIb)
with
A arbitrary.
includes positive integers and zero. Accordingly, eliminating the arbitrary number
A from the above equations, we can write
where
, and with
being an even integer.
Comments: Integers in (IIIa) and (IIIb) have been derived as positive integers. However they both enter quadratic expressions in which their overall sign can be reversed.
4.2. Applying the Shift Operators to Obtain Rational Solutions
For
we will show how to reproduce items (I)–(III) listed in Section (
4.1) in the setting of Painlevé V equation using the following construction:
The seeds of all rational solutions are the first-order polynomial solutions (
11), (12) and its
variants. Note that these seed solutions all depend on an arbitrary real parameter, customarily chosen here as
.
A class of rational solutions that can be obtained by successive operation by shift operators
, defined in the next
Section 4.3, of the form:
on polynomial solutions, (
11) can be expanded in positive power series in
z and does not contain a pole singularity and, if necessary (as in the case of Equation (
53)), having this singularity removed by
Bäcklund transformation. These two cases are described by the parameters presented in the above items I and II, respectively.
A class of rational solutions obtained from the seed polynomial solutions (12) will be derived by successive operation with shift operators
of the type
for distinct
and
containing positive integers and zero as only actions with shift operators given in Equation (
62) that are not causing divergencies. The results are summarized in item III in Section (
4.1).
We conclude that the well known fundamental results on classification of rational solutions of the Painlevé V equation first presented in [
9] are here obtained by acting with the operators (
61) on the first-order polynomial solutions (
11) and (12). In the latter case, we will encounter restrictions on those values of
for which the operators (
61) are well defined, as indicated in Equation (
62). See also [
10], which derived the rational solutions described above in items (Ia,Ib) and (II) via shift operators acting on solutions expressed by
functions and corresponding to (
11). The results of ref. [
9] were summarized succinctly in [
1].
4.3. The Fundamental Shift Operators for
To analyze transformations under the shift operators which we will introduce in this subsection it is convenient to first introduce the following representation of
parameters for the
case:
One checks that
is satisfied automatically without imposing any condition on
v’s.
Obviously, adding a constant term to all
will not change the final result in (
63) and thus we have an equivalence:
The Bäcklund transformations act in terms of simply as permutations between and : , while . The automorphism acts as follows: and .
Next, we introduce the shift operators
that act as simple translations on the
variables:
leading to:
or
Comparing expressions (
67) and (
66) we see that in the
representation it is very convenient to study how the parameter space of solutions of the dressing equation is being formed under actions of the shift operators. Generally the orbit of
under an action with
from Equation (
61) will be described by
. We are then able to associate a rational solution to each point of the orbit following the approach of
Section 4.2.
It is easy to extend the definition of the fundamental shift operators to arbitrary
N [
4,
10,
16]:
that for every
N, the weight lattice of
is generated. The shift operators commute with each other
and satisfy
, where we used that
and that
. These operators act on parameters
as
and further satisfy
. The inverse shift operators for
are:
For convenience, we also list the shift operators for
:
and their inverse
Within the framework of dressing chain equations with Bäcklund transformations (
6) it is actually possible to establish general transformation rules for the shift operator
acting on
,
for
, which applies to
and the initial configurations (
11), (
13):
etc., where
with
and
. The above equations lead to
which for
will lead to recurrence relations for
in case of
and for
in case of
. These recurrence relations will establish Umemura polynomial solutions as will be shown below.
4.4. Shift Operators Acting on the Solution
in Equation (11)
4.4.1. Parameters of the Solutions Obtained from the Seed Solution by Action of the Shift Operators
Consider solution (
11) such that
with an arbitrary parameter
and
. According to relation (
67), these solutions under action of (
61) will have the following final parameters
:
Thus, in agreement with item I in
Section 4.1 we find
where we introduced
In terms of these parameters, we can decompose
into a product of different factors
with each factor acting independently of the others on parameters in Equation (
76). Their action on expression (
11) with
induces the following transformations:
The conclusion in point 1 follows easily from the transformation rule:
where
is one of the components of solution (
11). A similar argument applies to point 2 since
. The first two top transformations in points 1 and 2 do not induce any change in
nor in
, thus the shift operators
and
equally increase Painlevé V parameters
and
and are not changing the
parameter. The above discussion shows that the two seed configurations
and
, both corresponding to the solution (
22) with parameters
and
such that
, with
m being an integer, can be connected by the transformation
with
, leaving
of equation (
22) unchanged. Thus, they both can give rise to an identical solution
of the Painlevé V equation via actions of different fundamental shift operators. However, this ambiguity disappears when the two seed solutions are considered as solutions (
11) of the dressing chain since their
components will transform non-trivially under
according to relation (
79) as long as
.
The shift operator
increases
by
, while
changes a difference between
and
of Painlevé V parameters. To illustrate how the Painlevé V parameters
transform under the above combinations of shift operators, we recall expressions (
38) and take into account expressions (
75) to obtain:
In terms of integers
, the above expressions can be rewritten succinctly as:
Sometimes one encounters a pole in an initial expression for
p as was the case in solution (
56), where
was used to remove the pole from
p. To cover such a case, we apply
Bäcklund transformation to obtain a configuration
. Then, applying
automorphism we arrive at
Acting with
from (
61) will yield:
with
setting
we get item (II) in Section (
4.1), in agreement with [
9], see also [
10].
Example 2. Consider again the case of solution (56) withand that contains a pole that can be removed by . Fitting the above α’s into relation (75) does not work since the method works for p being expandable in a positive series in z. We therefore try to fit it into a structure obtained from ’s acting on configuration : For , it is now easy to find a class of solutionswith being arbitrary integers. If we set f.i. , then and from the solution. Note that relations (
82) are equivalent with
Setting
, we can rewrite the above as
with
and
being an even number (see also [
9] or (I) in
Section 4.1.
Example 3. In this example, instead of connecting the solution (56) to the seed solution with we will rather take the polynomial solution (57) with obtained by acting with on solution (56) from [15] and show that it can be obtained from polynomial solution (11) withby successive operations of translation operations , each acting times. Recalling the actions of (67), we obtain the following 4 conditions for the solution (57) to be obtained from the solution (11) by ’s each acting times:with a general solution given in terms of arbitrary :that involves action by the shift operators equal to The above expression shows that there is no ambiguity related to the choice of and as and do not change the form of the solution. Therefore, for simplicity we eliminate the first two factors of the above expression by choosing:and thus the action of shift operators (61) becomes that of . The action of the inverse operator on is well defined and yields Applying on the above expressions we get:which for reproduces expression (57). 4.4.2. Umemura Polynomial Solutions Obtained from Seed Solution through Action of the Shift Operators
As follows from relations (
73) applied to the
case, we have the following recurrence relations
for transformations induced by
.
Since
and
, we find for
which can be rewritten as
where for
we introduced the following notation
and
Similarly from Equation (
73) we find
that can be rewritten as
and together with Equation (
85) form two recurrence relations for the canonical quantities
. One finds from relations (
85) and (
88) that
which shows that the quantity
is useful in describing transition from
to
. Indeed, we will be able below to formulate the recurrence relation for Umemura polynomials based on the existence of alternative expressions (
94) for
.
It is convenient to introduce the polynomials
to which we will refer as Umemura polynomials [
7,
11] defined for
by
Note that
is a polynomial of the
-th order. In terms of the above polynomials, we can express
in the following way
The repeating action of
operator on expressions (
92) gives rise to:
Using the recurrence relations (
85), (
88) one can alternatively express the quantity
as
Comparing the bottom of expressions (
93) with the two expressions in Equation (
94), we obtain two alternative recurrence relations for the Umemura polynomials which independently can be used to generate higher level Umemura polynomials.
It is convenient at this point to introduce the variable
and polynomials
which satisfy two recurrence relations that follow from comparing expressions (
93) with (
94):
Such redefined Umemura polynomials
are given for
by
from which higher polynomials can be obtained using recurrence relations (96) or (97). In addition, the polynomials
satisfy the identity
established on the basis of consistency of the shift operator approach with various operators
connected via
. Although we have chosen arbitrarily to generate the recurrence relations by acting with
, we could take any other shift operator as a starting point and be able to transfer from one formalism to another by applying the automorphism
through relation
. The identity (102) ensures that acting with any of the shift operators
on expressions (
92) will give rise to solutions that are still expressible in terms of Umemura polynomials
. For example, the repeating action of
operator on expressions (
92) yields:
Consider again equation (
93) for
and plug
into expression
for solution of the Painlevé V equation derived in
Section 3.2. After some simple algebra we find:
Using the identity (102) to rewrite the denominator, we obtain
for
with the Painlevé parameters:
agreeing with the solution (Ib) given at the beginning of
Section 4.
Consider now solution (103), generated by acting
n times with the shift operator
. The parameters
for this solution are equal to
. Plugging the above
into expression
and using the identity (102) we get
with the Painlevé V parameters
that agree with the solution (Ia) given at the beginning of
Section 4 for the Painlevé V variable
.
The fact that the above
y satisfies the Painlevé V equation is equivalent to the Umemura polynomials
satisfying the
-type of relation, which can be given a form of a Toda-like equation:
Next we define quantity:
where we suppressed dependence on
n on the left hand side. It is interesting to notice that, as follows from applications of all three identities (96), (97) and (102),
satisfies a discrete Painlevé II equation [
11]:
See [
17] for an early observation that Bäcklund transformations of continuous models can give rise to a discrete structure.
4.5. Action of the Shift Operators on Solution in (12)
By acting with
on
from Equation (12) with
we will arrive, in principle, at the following parameters of the final configuration
or
However not all of the shift transformations are well defined when acting on
. Since
and
we see from the definition (
6) that actions of
involve divisions by zero and therefore are not allowed. Recalling the definitions (
65) and (
70), we accordingly need to exclude
and
, as these operators contain
and
transformations at the positions to the right. Because the shift operators in (
65) and (
70) contain ordered products of neighboring Bäcklund transformations of the type
the divergence is only generated by the
located to the right. If the result of acting by
is not divergent, then acting with
would not be divergent, as follows from the definition (
6).
Accordingly, to avoid divergencies, we will only consider the operators with and .
Indeed, one can verify that
is permissible and generates
where
is found to satisfy the recurrence relation:
with
. The solution to this recurrence relation is given by
where we used the Pochhammer k-symbol
defined as
. We notice that
can be expressed as a function of
and in terms of
x it holds that
. Thus we find that
from Equation (110) satisfies
. Based on discussion around Equation (
43) from
Section 3.3, we expect that
is related to Kummer’s polynomial
. Indeed an explicit calculation of expression (111) yields
, which according to relation (
43) is equal (up to an overall constant) to
, a solution to the Kummer’s Equation (
41) with
,
. Here, we obtained this solution through acting
n-th times with
on the first-order solution (12). Since the Kummer’s functions found many applications in, e.g., solvable quantum mechanics, atomic physics, and critical phenomena, among other fields, the fact that, as shown above, their form can be reproduced by action of the shift operators should be of potential interest for these applications and efforts to expand them.
The shift operator
essentially acts as an identity
its only action is to increase
.
Let us now take a closer look at the action of
on
. Acting once with
yields:
Acting
n times with
on
we get
that satisfies the recurrence relation
the corresponding expression for
is
where the zero on the right hand side follows from the recurrence relation (113) connecting
.
It we assume that
satisfies the Riccati Equation (
39) for
and
, then it follows that
with
determined through the recurrence relation (113) will satisfy the same Riccati Equation (
39) for
. Since for
the function
satisfies the Riccati Equation (
39) for
this concludes the induction proof for
being equal to
, where
is given by expression (
40) in terms of Whittaker functions.
Based on the above discussion, we can rewrite Equation (109) as
after making a transformation
.
Accordingly, Equation (
114) gives rise to
or after elimination of an arbitrary constant
:
After learning how solution (12) transforms under a product of fundamental shift operators we turn our attention to the action of these operators on solutions that can be obtained from (12) by an automorphism . Acting with and on (12) we obtain, respectively, with and with as seeds configurations.
For
, we see that
and
. Thus, comparing with relations (
6) we recognize that the Bäcklund transformations
would involve divisions by zero. Accordingly, among the eight shift operators listed in (
65) and (
70), we need to discard
that contain the above-mentioned Bäcklund transformations in the positions to the right. Accordingly, we will only act with
with
, generating the following transformations of
:
The Painlevé parameters corresponding to (
117) are:
or
with
being positive integers or zero. The above equation is similar to relation (
116).
For
we see that
and
. We conclude from relations (
6) that the Bäcklund transformations
would involve divisions by zero. We therefore need to exclude
among the eight shift operators listed in (
65) and (
70). The action with the remaining shift operators
with
generates the following transformation of
:
The Painlevé parameters corresponding to (
118) are:
or
with
being positive integers or zero. Relations (
116) and (
119) constitute item (III) in Section (
4.1).
Example 4. Let us now consider the following example with solution taken from [15]: Expression for p has a pole which can be removed by applying . Applying we get We will match it with the initial configuration of (24) with and on which we can act with (but not ) to get: We choose to get the desired result. One can show for the corresponding combination of shift operators that and acting with such operator on and one easily reproduces the solution (121). Alternatively, we can obtain this solution as a special function solution when we recognize that for the condition from Equation (121), the Hamilton Equation (20) is solved by , which when inserted in the first equation in (20) reduces this equation to the Riccati equation , solved by Inserting , we recover from the above expression the rational solution (121). By comparing with results in [
9], we conclude that acting with shift operators on the first-order polynomial solutions of
dressing chain produces all rational solutions of the associated Painlevé system. We therefore conjecture that the same technique will produce all rational solutions for higher even
N values and discuss realization of this statement for
in the next section.
6. Summary and Comments
We identified rational solutions of the dressing chain equations of even periodicity with points of an orbit generated by the fundamental shift operators acting on all first-order polynomial solutions. It was described how additional Bäcklund transformation was needed to regularize those solutions that initially contained a simple pole.
For those first-order polynomial solutions which contain neighboring
and
such that:
for some
the action of some shift operators is not well-defined. Accordingly, those shift operators needed to be excluded in such cases and we have described the exclusion procedure in the paper. For orbits of the remaining well defined shift operators, we showed how this structure for
is responsible for a separate class of corresponding rational solutions (item III in
Section 4.1) of the Painlevé V equation. We also showed how the rational solutions generated by a single shift operator
are expressed by Kummer/Whittaker polynomials with arguments depending on integer
n.
The advantage of the formalism we presented is that it is universal, meaning that the derivation applies to all even-cyclic dressing chain systems or equivalent Painlevé equations as illustrated for the case of in addition to the case.
It is interesting to compare the derivation of elementary seed solutions for even-cyclic dressing chains with those encountered for odd-cyclic dressing chains. There are fundamental differences as the
parameters are fixed and do not depend on arbitrary variables. Also in contrast to the even-cyclic dressing chains, the fundamental variables
of the odd-cyclic dressing chains that satisfy Equation (
2) and the Painlevé variables
are fully equivalent, as the relation
is reversible through expression
for odd values of
N. For example for
one finds two elementary seed solutions that can be written as
,
, and
,
. It is well known that the rational solutions of the Painlevé IV equation can all be obtained by Bäcklund transformations from the above two seed solutions [
18], whether expressee in terms of
or
.
The natural next step, which we plan to pursue in the future, is to apply this framework to obtain closed determinant or special function expressions for rational solutions of all dressing chain equations of even periodicity generated by combined shift operators.