Next Article in Journal
An Enhanced Hybrid-Level Interface-Reduction Method Combined with an Interface Discrimination Algorithm
Previous Article in Journal
Smart Lithium-Ion Battery Monitoring in Electric Vehicles: An AI-Empowered Digital Twin Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Laguerre–Freud Equations for the Gauss Hypergeometric Discrete Orthogonal Polynomials †

by
Itsaso Fernández-Irisarri
and
Manuel Mañas
*
Departamento de Física Teórica, Universidad Complutense, 28040 Madrid, Spain
*
Author to whom correspondence should be addressed.
Dedicated to the memory of Diego Dominici.
Mathematics 2023, 11(23), 4866; https://doi.org/10.3390/math11234866
Submission received: 23 October 2023 / Revised: 23 November 2023 / Accepted: 24 November 2023 / Published: 4 December 2023

Abstract

:
The Cholesky factorization of the moment matrix is considered for the Gauss hypergeometric discrete orthogonal polynomials. This family of discrete orthogonal polynomials has a weight with first moment given by ρ 0 = 2 F 1 a , b c + 1 ; η . For the Gauss hypergeometric discrete orthogonal polynomials, also known as generalized Hahn of type I, Laguerre–Freud equations are found, and the differences with the equations found by Dominici and by Filipuk and Van Assche are provided.

1. Introduction

Discrete orthogonal polynomials constitute a well-established and distinguished branch of orthogonal polynomial theory. Various classical monographs have been dedicated to this category of orthogonal polynomials. For instance, the classical case is thoroughly examined in [1], and the Riemann–Hilbert problem has been employed to investigate asymptotics and applications, as discussed in [2]. Authoritative discussions of the subject can be found in [3,4,5,6].
Discrete orthogonal polynomials play a role in designing digital filters for signal processing applications. They help in representing signals in a more compact and efficient manner, facilitating analysis and manipulation. Discrete orthogonal polynomials are employed in approximating functions. They provide a basis for representing functions in terms of a series expansion, making it easier to approximate complex functions. Discrete orthogonal polynomials are used in coding theory for designing error-correcting codes. They help in constructing efficient encoding and decoding algorithms, improving the reliability of data transmission in communication systems. Discrete orthogonal polynomials are often involved in combinatorics, providing tools for solving combinatorial problems and deriving combinatorial identities.
Semiclassical discrete orthogonal polynomials, characterized by the satisfaction of a discrete Pearson equation by their weight functions, have received extensive attention in the literature. A comprehensive overview of this topic, along with extensive references, can be found in [7,8,9,10]. Furthermore, for certain specific weight types, such as the generalized Charlier and Meixner weights, the corresponding Freud–Laguerre-type equations governing the coefficients of the three-term recurrence have been investigated. Notable works in this area include [11,12,13,14,15].
In our work presented in [16], we harnessed the Cholesky factorization of the moment matrix to delve into the realm of discrete orthogonal polynomials denoted as { P n ( x ) } n = 0 on a homogeneous lattice. We directed our focus on semiclassical discrete orthogonal polynomials, defined by weight functions constrained by a discrete Pearson equation. This constraint led to the moments being expressible in terms of generalized hypergeometric functions.
We introduced a banded semi-infinite matrix named the Laguerre–Freud structure matrix Ψ , designed to model shifts by ± 1 in the independent variable of the sequence of orthogonal polynomials { P n ( x ) } n = 0 . Our study also unveiled that the contiguous relations governing the generalized hypergeometric functions have corresponding symmetries within the moment matrix. Furthermore, we established that the 3D Nijhoff–Capel discrete Toda lattice [17,18] offers a description of the contiguous shifts pertaining to the squared norms of the orthogonal polynomials.
In [19], we provided an interpretation for the contiguous transformations of generalized hypergeometric functions by invoking simple Christoffel and Geronimus transformations. Leveraging Geronimus–Uvarov perturbations, we derived determinantal expressions for the shifted orthogonal polynomials. Additionally, our exploration extended to three hypergeometric families and their associated Laguerre–Freud equations in [20].
In the research presented here, we extend and complete the investigations in [16,19,20], adding a new weight not studied so far with the similar techniques adapted to this situation. We delve into the realm of Gauss hypergeometric discrete orthogonal polynomials, which are also known as generalized Hahn polynomials of type I, as discussed in [9,10]. Our primary focus is an in-depth analysis of the Laguerre–Freud structure matrix Ψ . By examining its unique banded structure and its inherent compatibility with both the Toda equation and the Jacobi matrix, we uncover a set of nonlinear equations that govern the coefficients β n , γ n in the three-term recursion relations for the orthogonal polynomial sequence.
These nonlinear recurrences for the recursion coefficients take the following form:
γ n + 1 = F 1 ( n , γ n , γ n 1 , , β n , β n 1 , ) , β n + 1 = F 2 ( n , γ n + 1 , γ n , , β n , β n 1 , ) ,
with F 1 and F 2 being specific functions. Notably, these relations, referred to as Laguerre–Freud relations by Magnus [21] in reference to [22,23], have been explored in numerous papers for cases like generalized Charlier, generalized Meixner, and Gauss hypergeometric, as documented in [7,14].
A crucial insight that emerges is the role of the τ -function, defined as the Wronskian of the Gauss hypergeometric functions. This τ -function proves to be a valuable solution for each of these systems of nonlinear Laguerre–Freud equations governing the recursion coefficients.
This paper’s structure is outlined as follows: In Section 2, we delve into the world of Gauss hypergeometric discrete orthogonal polynomials, as initially introduced in [7,9]. We present the pentadiagonal Laguerre–Freud structure matrix in Theorem 3. Additionally, we delve into the Laguerre–Freud relations in Theorem 4, providing a comparative analysis with Dominici’s findings in [7] and those of Filipuk & Van Assche in [14], as well as the work presented in [24].
To round off this introduction, let us begin by summarizing the foundational concepts of discrete orthogonal polynomials. Afterward, we will provide a brief overview of the significant findings from our previous work in [16].

1.1. Basics on Orthogonal Polynomials

Given a linear functional ρ z C * [ z ] , the corresponding moment matrix is
G = ( G n , m ) , G n , m = ρ n + m , ρ n = ρ z , z n , n , m N 0 { 0 , 1 , 2 , } ,
with ρ n the n-th moment of the linear functional ρ z . If the moment matrix is such that all its truncations, which are Hankel matrices, G i + 1 , j = G i , j + 1 ,
Mathematics 11 04866 i001
are nonsingular; i.e., the Hankel determinants Δ k det G [ k ] do not cancel, Δ k 0 , k N 0 . If this is the case, we have monic polynomials.
P n ( z ) = z n + p n 1 z n 1 + + p n n , n N 0 ,
with p 0 1 = 0 , fulfilling the orthogonality relations
ρ , P n ( z ) z k = 0 , k { 0 , , n 1 } , ρ , P n ( z ) z n = H n 0 ,
and { P n ( z ) } n N 0 is a sequence of orthogonal polynomials, i.e., ρ , P n ( z ) P m ( z ) = δ n , m H n for n , m N 0 . The symmetric bilinear form F , G ρ ρ , F G , is such that the moment matrix is the Gram matrix of this bilinear form and P n , P m ρ δ n , m H n .
Introducing χ ( z ) 1 z z 2 · · the moment matrix is G = ρ , χ χ , and χ is an eigenvector of the shift matrix, Λ χ = x χ , where
Mathematics 11 04866 i002
Hence, Λ G = G Λ , and the moment matrix is a Hankel matrix.
As the moment matrix symmetric its Borel–Gauss factorization is a Cholesky factorization
G = S 1 H S ,
where S is a lower unitriangular matrix that can be written as
Mathematics 11 04866 i003
and H = diag ( H 0 , H 1 , ) is a diagonal matrix, with H k 0 , for k N 0 . The Cholesky factorization does hold whenever the principal minors of the moment matrix; i.e., the Hankel determinants Δ k , do not cancel.
The components P n ( z ) of
P ( z ) S χ ( z ) ,
are the monic orthogonal polynomials of the functional ρ .
Proposition 1.
We have the determinantal expressions
H n = Δ n + 1 Δ n , p n 1 = Δ ˜ n Δ n ,
with the Hankel determinants given by
Mathematics 11 04866 i004
We introduce the lower Hessenberg semi-infinite matrix
J = S Λ S 1
that has the vector P ( z ) as eigenvector with eigenvalue z, J P ( z ) = z P ( z ) . The Hankel condition Λ G = G Λ and the Cholesky factorization gives
J H = ( J H ) = H J .
As the Hessenberg matrix J H is symmetric, the Jacobi matrix J is tridiagonal. The Jacobi matrix J given in (3) reads
Mathematics 11 04866 i005
The eigenvalue equation J P = z P is a three term recursion relation z P n ( z ) = P n + 1 ( z ) + β n P n ( z ) + γ n P n 1 ( z ) , that with the initial conditions P 1 = 0 and P 0 = 1 completely determines the sequence of orthogonal polynomials { P n ( z ) } n = 0 in terms of the recursion coefficients β n , γ n . The recursion coefficients, in terms of the Hankel determinants, are given by
β n = p n 1 p n + 1 1 = Δ ˜ n Δ n + Δ ˜ n + 1 Δ n + 1 , γ n + 1 = H n + 1 H n = Δ n + 1 Δ n 1 Δ n 2 , n N 0 .
For future use, we introduce the following diagonal matrices γ diag ( γ 1 , γ 2 , ) and β diag ( β 0 , β 1 , ) and J Λ γ and J + β + Λ , so that we have the splitting J = Λ γ + β + Λ = J + J + . In general, given any semi-infinite matrix A, we will write A = A + A + , where A is a strictly lower triangular matrix and A + an upper triangular matrix. Moreover, A 0 will denote the diagonal part of A.
The lower Pascal matrix is defined by
B = ( B n , m ) , B n , m n m , n m , 0 , n < m ,
so that
χ ( z + 1 ) = B χ ( z ) .
Moreover,
B 1 = ( B ˜ n , m ) , B ˜ n , m ( 1 ) n + m n m , n m , 0 , n < m ,
and χ ( z 1 ) = B 1 χ ( z ) . The lower Pascal matrix and its inverse are explicitly given by
Mathematics 11 04866 i006
in terms of which we introduce the dressed Pascal matrices, Π S B S 1 and Π 1 S B 1 S 1 , which are connection matrices; i.e.,
P ( z + 1 ) = Π P ( z ) , P ( z 1 ) = Π 1 P ( z ) .
The lower Pascal matrix can be expressed in terms of its subdiagonal structure as follows
B ± 1 = I ± Λ D + Λ 2 D [ 2 ] ± Λ 3 D [ 3 ] + ,
where D = diag ( 1 , 2 , 3 , ) and D [ k ] = 1 k diag k ( k ) , ( k + 1 ) ( k ) , ( k + 2 ) ( k ) , in terms of the falling factorials x ( k ) = x ( x 1 ) ( x 2 ) ( x k + 1 ) . That is,
D n [ k ] = ( n + k ) ( n + 1 ) k , k N , n N 0 .
The lower unitriangular factor can be also written in terms of its subdiagonals S = I + Λ S [ 1 ] + Λ 2 S [ 2 ] + with S [ k ] = diag S 0 [ k ] , S 1 [ k ] , . From (2) is clear the following connection between these subdiagonals entries and the coefficients of the orthogonal polynomials given in (1)
S n [ k ] = p n + k k .
We will use the shift operators  T ± acting over the diagonal matrices as follows
T diag ( a 0 , a 1 , ) diag ( a 1 , a 2 , ) , T + diag ( a 0 , a 1 , ) diag ( 0 , a 0 , a 1 , ) .
These shift operators have the following important properties, for any diagonal matrix A = diag ( A 0 , A 1 , )
Λ A = ( T A ) Λ , A Λ = Λ ( T + A ) , A Λ = Λ ( T A ) , Λ A = ( T + A ) Λ .
In terms of these shift operators, we find
2 D [ 2 ] = ( T D ) D , 3 D [ 3 ] = ( T 2 D ) ( T D ) D = 2 ( T D [ 2 ] ) D = 2 D [ 2 ] ( T 2 D ) .
Proposition 2.
The inverse matrix S 1 of the matrix S expands as follows
S 1 = I + Λ S [ 1 ] + Λ 2 S [ 2 ] + .
The subdiagonals S [ k ] are given in terms of the subdiagonals of S. In particular,
S [ 1 ] = S [ 1 ] , S [ 2 ] = S [ 2 ] + ( T S [ 1 ] ) S [ 1 ] , S [ 3 ] = S [ 3 ] + ( T S [ 2 ] ) S [ 1 ] + ( T 2 S [ 1 ] ) S [ 2 ] ( T 2 S [ 1 ] ) ( T S [ 1 ] ) S [ 1 ] .
Remark 1.
Corresponding expansions for the dressed Pascal matrices are
Π ± 1 = I + Λ π [ ± 1 ] + ( Λ ) 2 π [ ± 2 ] +
with π [ ± n ] = diag ( π 0 [ ± n ] , π 1 [ ± n ] , ) .
Proposition 3
(The dressed Pascal matrix coefficients). We have
π n [ ± 1 ] = ± ( n + 1 ) , π n [ ± 2 ] = ( n + 2 ) ( n + 1 ) 2 ± p n + 2 1 ( n + 1 ) ( n + 2 ) p n + 1 1 = ( n + 2 ) ( n + 1 ) 2 ( n + 1 ) β n + 1 p n + 1 1 ,
π n [ ± 3 ] = ± ( n + 3 ) ( n + 2 ) ( n + 1 ) 3 + ( n + 2 ) ( n + 1 ) 2 p n + 3 1 ( n + 3 ) ( n + 2 ) 2 p n + 1 1 ± ( n + 1 ) p n + 3 2 ( n + 3 ) p n + 2 2 ± ( n + 3 ) p n + 2 1 p n + 1 1 ( n + 2 ) p n + 3 1 p n + 1 1 .
Moreover, the following relations are fulfill
π [ 1 ] + π [ 1 ] = 0 , π [ 2 ] + π [ 2 ] = 2 D [ 2 ] , π [ 3 ] + π [ 3 ] = 2 ( ( T 2 S [ 1 ] ) D [ 2 ] ( T D [ 2 ] ) S [ 1 ] ) .

1.2. Discrete Orthogonal Polynomials and Pearson Equation

We are interested in measures with support on the homogeneous lattice N 0 as follows ρ = k = 0 δ ( z k ) w ( k ) , with moments given by
ρ n = k = 0 k n w ( k ) ,
and, in particular, with 0-th moment given by
ρ 0 = k = 0 w ( k ) .
The weights we consider in this paper satisfy the following discrete Pearson equation
θ ( k + 1 ) w ( k + 1 ) = σ ( k ) w ( k ) , k N 0 .
Theorem 1
(Hypergeometric symmetries). Let the weight w be subject to a discrete Pearson equation of the type (9), where the functions θ , σ are polynomials, with θ ( 0 ) = 0 . Then,
(i) 
The moment matrix fulfills
θ ( Λ ) G = B σ ( Λ ) G B .
(ii) 
The Jacobi matrix satisfies
Π 1 H θ ( J ) = σ ( J ) H Π ,
and the matrices H θ ( J ) and σ ( J ) H are symmetric.
If N + 1 deg θ ( z ) and M deg σ ( z ) , and zeros of these polynomials are { b i + 1 } i = 1 N and { a i } i = 1 M we write θ ( z ) = z ( z + b 1 1 ) ( z + b N 1 ) and σ ( z ) = η ( z + a 1 ) ( z + a M ) . According to (8) the 0-th moment
ρ 0 = k = 0 w ( k ) = k = 0 ( a 1 ) k ( a M ) k ( b 1 + 1 ) k ( b N + 1 ) k η k k ! = M F N a 1 · · · · · · · a M b 1 · · · · · · · b N ; η .
is the generalized hypergeometric function, where we are using the standard notationamc+amc+, see [25]. Then, according to (7), for n N , the corresponding higher moments ρ n = k = 0 k n w ( k ) , are
ρ n = ϑ η n ρ 0 = ϑ η n M F N a 1 · · · · · · · a M b 1 · · · · · · · b N ; η , ϑ η η η .
Given a function f ( η ) , we consider the Wronskian of the covector
δ ( f ) [ f ϑ f · · · · · · · ϑ n f ]
given by
Mathematics 11 04866 i007
We refer to this Wronskian as the δ -Wronskian of f. Then, we have that the Hankel determinants Δ n = det G [ n ] determined by the truncations of the corresponding moment matrix are δ -Wronskians of generalized hypergeometric functions,
Δ n = τ n , Δ ˜ n = ϑ η τ n ,
where
τ n W n M F N a 1 · · · · · · · a M b 1 · · · · · · · b N ; η .
Moreover, using Proposition 1 we get
H n = τ n + 1 τ n , p n 1 = ϑ η log τ n , n N 0 .
The functions τ k are the well known tau functions [17]. In terms of these τ -functions we have
β n = ϑ η log τ n + 1 τ n , γ n + 1 = τ n + 1 τ n 1 τ n 2 , n N 0 ,
were we have used (4), (10) and (11).
Theorem 2
(Laguerre–Freud structure matrix). Let us assume that the weight w solves the discrete Pearson Equation (9) with θ , σ polynomials such that θ ( 0 ) = 0 , deg θ ( z ) = N + 1 , deg σ ( z ) = M . Then, the Laguerre–Freud structure matrix
Ψ Π 1 H θ ( J ) = σ ( J ) H Π = Π 1 θ ( J ) H = H σ ( J ) Π = θ ( J + I ) Π 1 H = H Π σ ( J I ) ,
has only N + M + 2 possibly nonzero diagonals ( N + 1 superdiagonals and M subdiagonals)
Ψ = ( Λ ) M ψ ( M ) + + Λ ψ ( 1 ) + ψ ( 0 ) + ψ ( 1 ) Λ + + ψ ( N + 1 ) Λ N + 1 ,
for some diagonal matrices ψ ( k ) . In particular, the lowest subdiagonal and highest superdiagonal are given by
( Λ ) M ψ ( M ) = η ( J ) M H , ψ ( M ) = η H k = 0 M 1 T k γ = η diag H 0 k = 1 M γ k , H 1 k = 2 M + 1 γ k , , ψ ( N + 1 ) Λ N + 1 = H ( J ) N + 1 , ψ ( N + 1 ) = H k = 0 N T k γ = diag H 0 k = 1 N + 1 γ k , H 1 k = 2 N + 2 γ k , .
The vector P ( z ) of orthogonal polynomials fulfill the following structure equations
θ ( z ) P ( z 1 ) = Ψ H 1 P ( z ) , σ ( z ) P ( z + 1 ) = Ψ H 1 P ( z ) .
The compatibility of the recursion relation, i.e., Eigenfunctions of the Jacobi matrix, and the recursion matrix leads to some interesting equations:
Proposition 4.
The following compatibility conditions for the Laguerre–Freud and Jacobi matrices hold
[ Ψ H 1 , J ] = Ψ H 1 , [ J , Ψ H 1 ] = Ψ H 1 .

1.3. The Toda Flows

Let us define the strictly lower triangular matrix Φ ( ϑ η S ) S 1 .
Proposition 5.
(i) 
The semi-infinite vector P fulfills
ϑ η P = Φ P .
(ii) 
The Sato–Wilson equations holds
Φ H + ϑ η H H Φ = J H .
Consequently, Φ = J and n N 0 we have ϑ η log H n = J n , n .
Moreover,
Proposition 6
(Toda). The following equations hold
Φ = ( ϑ η S ) S 1 = Λ γ , ( ϑ η H ) H 1 = β .
In particular, for n , k 1 N , we have
ϑ η p n 1 = γ n , ϑ η p n + k k = γ n + k p n + k 1 k 1 , ϑ η log H n = β n .
The functions q n log H n , n N , satisfy the Toda equations
ϑ η 2 q n = e q n + 1 q n e q n q n 1 .
For n N , we also have ϑ η P n ( z ) = γ n P n 1 ( z ) .
Proposition 7.
The following Lax equation holds ϑ η J = [ J + , J ] . The recursion coefficients satisfy the following Toda system
ϑ η β n = γ n + 1 γ n ,
ϑ η log γ n = β n β n 1 ,
for n N 0 and β 1 = 0 . Consequently, we get
ϑ η 2 log γ n = γ n + 1 2 γ n + γ n 1 .
For the compatibility of (5) and (15) we obtain ϑ η ( Π ) = [ Φ , Π ] . In the general case the dressed Pascal matrix Π is a lower unitriangular semi-infinite matrix that possibly has an infinite number of subdiagonals. However, for the case when the weight w ( z ) = v ( z ) η z satisfies the Pearson Equation (9), with v independent of η , that is θ ( k + 1 ) v ( k + 1 ) η = σ ( k ) v ( k ) , the situation improves as we have the banded semi-infinite matrix Ψ that models the shift in the z variable as in (14). From the previous discrete Pearson equation, we see that σ ( z ) = η κ ( z ) with κ , θ   η -independent polynomials in z
θ ( k + 1 ) v ( k + 1 ) = η κ ( k ) v ( k ) .
Proposition 8.
Let us assume a weight w satisfying the Pearson Equation (9). Then, the Laguerre–Freud structure matrix Ψ given in (13) satisfies
ϑ η ( η 1 Ψ H 1 ) = [ Φ , η 1 Ψ H 1 ] ,
ϑ η ( Ψ H 1 ) = [ Φ , Ψ H 1 ] .
Relations (17a) and (17b) are gauge equivalent.

2. Gauss Hypergeometric Weights

The choice of σ ( z ) = η ( z + a ) ( z + b ) and θ ( z ) = z ( z + c ) results in the following Pearson equation:
( k + 1 ) ( k + 1 + c ) w ( k + 1 ) = η ( k + a ) ( k + b ) w ( k )
with solutions proportional to: w ( z ) = ( a ) z ( b ) z ( c + 1 ) z η z z ! . As documented in [7,9], this weight function falls under the category of generalized Hahn weight of type I. The first moment is given by ρ 0 = 2 F 1 a , b c + 1 ; η , which is expressed as the Gauss hypergeometric function. For the specific case when η = 1 , Hahn introduced these discrete orthogonal polynomials in [26]. Notably, the standard “Hahn polynomials” commonly found in the literature have parameters set as a = α + 1 , b = N , and c = N 1 β , where N is a positive integer.
The Gauss hypergeometric series is convergent for | η | < 1 and divergent for | η | > 1 . For | η | = 1 , η 1 , the series is absolutely convergent whenever Re ( c + 1 a b ) > 0 and convergent and not absolutely convergent for 1 < Re ( c + 1 a b ) 0 . Finally, for Re ( c + 1 a b ) = 1 , the series is convergent for Re ( a + b ) > Re a b and divergent for Re ( a + b ) Re a b . See [27].
Remark 2.
By referring to previous comments and utilizing (12), we establish that in terms of the following δ-Wronskian of the Gauss hypergeometric function
τ n W n 2 F 1 a , b c + 1 ; η ,
we can derive explicit expressions for the recursion coefficients:
β n = ϑ η log τ n + 1 τ n , γ n + 1 = τ n + 1 τ n 1 τ n 2 ,
where n belongs to the set of non-negative integers, denoted as N 0 .
Theorem 3
(The Gauss hypergeometric Laguerre–Freud structure matrix). For a Gauss hypergeometric weight; i.e., σ = η ( z + a ) ( z + b ) and θ = z ( z + c ) , we find
p n + 1 1 = ( n + 2 ) β n + 2 + β n + 1 + η 1 η + 1 γ n + 3 + γ n + 2 + β n + 2 2 + ( n + 2 ) ( n + 1 ) 2 + 1 η + 1 η a b + ( η ( a + b ) c ) β n + 2 + ( η ( a + b ) + c ) ( n + 2 ) ,
π n [ 2 ] = 1 1 + η ( n + 2 ) ( n + 1 ) η a b ( η ( a + b ) c ) β n + 2 ( η ( a + b ) + c ) ( n + 2 ) + 1 η 1 + η ( γ n + 3 + γ n + 2 + β n + 2 2 ) ( n + 2 ) ( β n + 2 + β n + 1 ) .
The Laguerre–Freud structure matrix is
Mathematics 11 04866 i008
Proof. 
In this case, due to the properties of the polynomials σ and θ , the Freud–Laguerre matrix exhibits a specific diagonal structure:
Ψ = ( Λ ) 2 ψ ( 2 ) + Λ ψ ( 1 ) + ψ ( 0 ) + ψ ( 1 ) Λ + ψ ( 2 ) Λ 2 .
This structure consists of two subdiagonals, two superdiagonals, and the main diagonal.
On one hand, starting with the equation Ψ = σ ( J ) H Π , we can derive the Laguerre–Freud structure matrix as follows:
Ψ = η Λ γ Λ γ H second subdiagonal + η ( Λ γ Λ γ H D Λ + Λ γ ( β + b ) H + ( β + a ) Λ γ H ) first subdiagonal + η ( Λ γ Λ H + Λ Λ γ H + ( β + a ) ( β + b ) H + ( Λ γ ( β + b ) + ( β + a ) Λ γ ) H D Λ main diagonal + Λ γ Λ γ H π [ 2 ] Λ 2 ) main diagonal + η ( ( β + a ) ( β + b ) + Λ γ Λ + Λ Λ γ H D Λ + ( β + a ) Λ H + Λ ( β + b ) H first superdiagonal + Λ ( β + b ) H π [ 2 ] Λ 2 + ( β + a ) Λ H π [ 2 ] Λ 2 + Λ γ Λ γ H π [ 3 ] Λ 3 ) first superdiagonal + η ( Λ γ Λ γ H π [ 4 ] Λ 4 + Λ γ ( β + b ) + ( β + a ) Λ γ H π [ 3 ] Λ 3 second superdiagonal + Λ γ Λ + Λ Λ γ + ( β + a ) ( β + b ) H π [ 2 ] Λ 2 + Λ ( β + b ) + ( β + a ) Λ H D Λ + Λ 2 H ) second superdiagonal .
On the other hand, by using the equation Ψ = Π 1 H θ ( J ) , we can deduce:
Ψ = H ( Λ ) 2 + Λ D H Λ ( β + T β + c ) + ( Λ ) 2 π [ 2 ] H ( γ + T + γ + β 2 + c β ) second subdiagonal ( Λ ) 3 π [ 3 ] H ( β + T β + c ) γ Λ + ( Λ ) 4 π [ 4 ] H ( T γ ) γ Λ 2 second subdiagonal + H Λ ( β + T β + c ) Λ D H ( γ + T + γ + β 2 + c β ) first subdiagonal + ( Λ ) 2 π [ 2 ] H ( β + T β + c ) γ Λ ( Λ ) 3 π [ 3 ] H ( T γ ) γ Λ 2 first subdiagonal + H ( γ + T + γ + β 2 + c β ) Λ D H ( β + T β + c ) γ Λ + ( Λ ) 2 π [ 2 ] H ( T γ ) γ Λ 2 main diagonal + H ( β + T β + c ) γ Λ Λ D H ( T γ ) γ Λ 2 first superdiagonal + H ( T γ ) γ Λ 2 second superdiagonal
From (18), we can extract the first two subdiagonals of Ψ , which are as follows:
ψ ( 2 ) = η H γ T γ , ψ ( 1 ) = η γ T + γ T + H + γ ( β + b ) H + ( T β + a ) γ H ,
From (19), we can determine the first two superdiagonals of Ψ , which are as follows:
ψ ( 1 ) = ( β + T β + c ) γ ( T + D ) ( T + H ) γ T + γ , ψ ( 2 ) = H ( T γ ) γ .
We can derive an expression for the main diagonal that is independent of π [ + 2 ] or π [ 2 ] by equating the terms associated with the main diagonal in the two previous expressions, namely (18) and (19). This yields:
( η 1 ) ( T + γ + γ + β 2 ) + β [ η ( a + b ) c ] + η a b + ( η + 1 ) ( T + D ) [ T + β + β ] + ( T + D ) [ η ( a + b ) + c ] = T + 2 ( π [ 2 ] η π [ 2 ] ) .
Referring back to (6), which states that π n [ ± 2 ] = ( n + 2 ) ( n + 1 ) 2 ( n + 1 ) β n + 1 p n + 1 1 , and substituting this into the previous expression, we can eliminate p n + 1 1 . We can then replace this result in the expression for π [ 2 ] , ensuring that the main diagonal is no longer dependent on it. Examining each term in the first equation and isolating p n + 1 1 , we obtain
p n + 1 1 = ( n + 2 ) β n + 2 + β n + 1 + η 1 η + 1 γ n + 3 + γ n + 2 + β n + 2 2 + ( n + 2 ) ( n + 1 ) 2 + 1 η + 1 η a b + ( η ( a + b ) c ) β n + 2 + ( η ( a + b ) + c ) ( n + 2 ) ,
and the diagonal matrix entries of π [ 2 ] are
π n [ 2 ] = 1 1 + η ( n + 2 ) ( n + 1 ) η a b ( η ( a + b ) c ) β n + 2 ( η ( a + b ) + c ) ( n + 2 ) + 1 η 1 + η ( γ n + 3 + γ n + 2 + β n + 2 2 ) ( n + 2 ) ( β n + 2 + β n + 1 ) .
Simplifying further, we obtain the Laguerre–Freud matrix as
Ψ = η ( Λ ) 2 T 2 H + η Λ a + b + T + D + β + T β T H + η T + γ + γ + ( β + a ) ( β + b ) + T + ( D ) ( a + b + T + β + β ) + T + 2 π [ 2 ] ) H + ( c T + D + β + T β ) T H Λ + T 2 H Λ 2 .
Now, let’s investigate the compatibility condition [ Ψ H 1 , J ] = Ψ H 1 .
Theorem 4
(Laguerre–Freud equations for Gauss hypergeometric). The Gauss hypergeometric recursion coefficients satisfy the following Laguerre–Freud relations
( η 2 1 ) ( β n + 1 + β n ) γ n + 1 ( β n 1 + β n ) γ n + η β n ( 2 β n + a + b + c ) + 2 ( γ n + 1 + γ n ) + n ( a + b c + n 1 ) + a b + ( η + 1 ) η ( a + b ) c ( η + 1 ) n ( γ n + 1 γ n ) + ( η + 1 ) γ n = 0 ,
( η + 1 ) ( ( n 1 ) β n + ( n + 1 ) β n + 1 ) + ( η 1 ) ( γ n + 2 γ n + β n + 1 2 β n 2 + n ) + ( η ( a + b ) c ) ( β n + 1 β n ) + η ( a + b ) + c = 0 .
Proof. 
We analyze the compatibility [ Ψ H 1 , J ] = Ψ H 1 by diagonals. In both sides of the equation, we find matrices whose only non-zero diagonals are the main diagonal, the first and second subdiagonals, and the first and second superdiagonals. Equating the non-zero diagonals of both matrices, two identities for the second superdiagonal and subdiagonal are obtained. From the remaining diagonals, we obtain the two Laguerre–Freud equations (we obtain the same equality from the first subdiagonal and from the first superdiagonal). Firstly, by simplifying, we obtain that
Ψ H 1 = η ( Λ ) 2 ( T γ ) γ + η Λ γ ( T + ( D ) + ( β + b ) + T ( β + a ) ) + η η + 1 2 ( T + γ + γ + β 2 ) + ( a + b + c ) β + a b + T + D ( a + b c ) + T + D T + 2 D + ( β + T β + c T + ( D ) ) Λ + Λ 2 .
From the main diagonal, clearing, we obtain
( 1 η ) β n 1 γ n + ( η 1 ) β n + 1 γ n + 1 + β n ( η η + 1 ( 2 β n + a + b + c ) + ( η 1 ) ( γ n + 1 γ n ) ) + ( η η + 1 ( 2 ( γ n + 1 + γ n ) n c + n ( a + b + n 1 ) + a b ) ( η + 1 ) ( n ( γ n γ n + 1 ) γ n ) + ( η ( a + b ) c ) ( γ n + 1 γ n ) ) = 0
and we get Equation (20a).
We obtain the following expressions from the first superdiagonal and the first subdiagonal:
( ( η + 1 ) ( β n + β n + 1 + n ( β n + 1 β n ) ) + ( η 1 ) ( γ n + 2 γ n + β n + 1 2 β n 2 + n ) + c ( 1 + β n β n + 1 ) + η ( a + b ) ( 1 + β n + 1 β n ) = 0
which results in Equation (20b). □
We now proceed with the compatibility condition [ Ψ H 1 , J ] = ϑ η ( Ψ H 1 ) . Recall that J Λ γ and ϑ η = η d d η . As we will see, we do not obtain any further equations beyond those already obtained in Theorem 4.
Proposition 9.
The recursion coefficients for the Gauss hypergeometric discrete orthogonal polynomials satisfy the following Laguerre–Freud relations:
ϑ η ( β n + β n + 1 + c n ) = γ n + 2 γ n ,
ϑ η η η + 1 ( 2 ( γ n + 1 + γ n + β n 2 ) + c ( β n n ) + n ( n 1 ) + ( a + b ) ( β n + n ) + a b ) = γ n + 1 ( β n + β n + 1 + c n ) γ n ( β n 1 + β n + c ( n 1 ) ) ,
ϑ η ( η γ n + 1 ( n + a + b + β n + β n + 1 ) ) = η η + 1 γ n + 1 ( 2 ( γ n + 2 γ n + β n + 1 2 β n 2 ) + ( a + b + c ) ( β n + 1 β n ) + 2 n + ( a + b c ) )
ϑ η ( η γ n + 1 γ n + 2 ) = η γ n + 1 γ n + 2 ( β n + 2 β n + 1 ) .
Proof. 
From the diagonals of [ Ψ H 1 , J ] = ϑ η ( Ψ H 1 ) we get
(i)
From the first superdiagonal we obtain (21a)
(ii)
From the main diagonal cleaning up we get (21b).
(iii)
From the first subdiagonal we get, symplifying (21c).
(iv)
Finally, from the second subdiagonal we get (21d).
Remark 3.
We observe that (21a) follow from the Toda Equations (16a), and (21d) follow from Toda Equation (16b). Moreover, the two remaining equations (from the main diagonal and the first subdiagonal) coincide with those presented in Theorem 4.
Remark 4.
Dominici in [7] (Theorem 4) found the following Laguerre–Freud equations
( 1 η ) ( γ n + 1 + γ n ) = η v n ( β n + n ) u n ( β n n ) , Δ ( u n η v n ) γ n = u n ( β n n ) + ( γ n + 1 + γ n ) ,
with  u n β n + β n + 1 n + c + 1  and  v n β n + β n 1 + n 1 + a + b . Therefore, the first one is of type γ n + 1 = F 1 ( n , γ n , γ n 1 , β n , β n 1 ) , of length two, and the second of the form β n + 1 = F 2 ( n , γ n + 1 , γ n , γ n 1 , β n , β n 1 , β n 2 ) , is of length three.
Remark 5.
Filipuk and Van Assche in [14] (Equations (3.6) and (3.9)) introduce new non local variables ( x n , y n ) ,
β n = x n + n + ( n + a + b ) η c 1 1 η , 1 η η γ n = y n + k = 0 n 1 x k + n ( n + a + b c 2 ) 1 η .
Then, in [14] (Theorem 3.1) Equations (3.13) and (3.14) for ( x n , y n ) are found, of length 0 and 1 respectively, in the new variables. Recall that these new variables are non-local and involve all the previous recursion coefficients. In this respect, the meaning of length is not so clear. The nice feature in this case is that [14] (Equations (3.13) and (3.14)) are discrete Painlevé equations that, combined with the Toda equations, lead to a differential system for the new variables x n and y n that, after suitable transformation, can be reduced to Painlevé VI σ-equation. Recently, it has been shown in [24] that this system is equivalent to dP ( D 4 ( 1 ) / D 4 ( 1 ) ) , known as the difference Painlevé V.

3. Conclusions and Outlook

In their studies of integrable systems and orthogonal polynomials, Adler and van Moerbeke have thoroughly used the Gauss–Borel factorization of the moment matrix (see [28,29,30]). This strategy has been extended and applied by us in different contexts, such as CMV orthogonal polynomials, matrix orthogonal polynomials, multiple orthogonal polynomials, and multivariate orthogonal polynomials (see [31,32,33]). For a general overview, see [34].
Recently, we extended those ideas to the discrete world (see [16]). In particular, we applied that approach to the study of the consequences of the Pearson equation on the moment matrix and Jacobi matrices. For that description, a new banded matrix is required, the Laguerre–Freud structure matrix, which encodes the Laguerre–Freud relations for the recurrence coefficients. We have also found that the contiguous relations fulfilled by generalized hypergeometric functions, which determine the moments of the weight, describe a discrete Toda hierarchy known as the Nijhoff–Capel equation (see [18]). In [19], we study the role of Christoffel and Geronimus transformations in the description of the mentioned contiguous relations, as well as the use of Geronimus–Christoffel transformations to characterize the shifts in the spectral independent variable of the orthogonal polynomials.
In this paper, we delve deeper into that program and further explore the discrete semiclassical cases. We find Laguerre–Freud relations for the recursion coefficients of Gauss hypergeometric discrete orthogonal polynomials. We observe that a solution of the Laguerre–Freud-type nonlinear equations for the recursion coefficients is provided by the τ -function, which is defined as a Wronskian of the Gauss hypergeometric functions, respectively. Notice that in [20], we presented a study similar to the one in this paper for the hypergeometric cases 1 F 2 , 2 F 2 and 3 F 2 .
For the future, we will extend these techniques to multiple discrete orthogonal polynomials [35] and their relations with the transformations presented in [36], as well as quadrilateral lattices [37,38].

Author Contributions

Conceptualization, M.M.; Methodology, M.M.; Investigation, I.F.-I. and M.M.; Writing—original draft, M.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Spanish “Agencia Estatal de Investigación” research project [PI0D2021-122154NB-I0], Ortogonalidad y Aproximación con Aplicaciones en Machine Learning y Teoría de la Probabilidad.

Data Availability Statement

This paper has no associated data.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nikiforov, A.F.; Suslov, S.K.; Uvarov, V.B. Classical Orhogonal Polynomials of a Discrete Variable; Springer Series in Computational Physics; Springer: Berlin/Heidelberg, Germany, 1991. [Google Scholar]
  2. Baik, J.; Kriecherbauer, T.; McLaughlin, K.T.-R.; Miller, P.D. Discrete Orthogonal Poly-nomials. In Annals of Mathematics Studies; Princeton University Press: Princeton, NJ, USA, 2007; Volume 164. [Google Scholar]
  3. Beals, R.; Wong, R. Special functions and orthogonal polynomials. In Cambridge Studies in Advanced Mathematics; Cambridge University Press: Cambridge, UK, 2016; Volume 153. [Google Scholar]
  4. Ismail, M.E.H. Classical and Quantum Orthogonal Polynomails in One Variable. In Encyclopedia of Mathematics and Its Applications; Cambridge University Press: Cambridge, UK, 2009; Volume 98. [Google Scholar]
  5. Ismail, M.E.H.; Van Assche, W. Encyclopedia of Special Functions: The Askey–Bateman Project. Volume I: Univariate Orthogonal Poly-Nomials; Ismail, M., Ed.; Cambridge University Press: Cambridge, UK, 2020. [Google Scholar]
  6. Van Assche, W. Orthogonal Polynomials and Painlevé Equations; Australian Mathematical Society Lecture Series; Cambridge University Press: Cambridge, UK, 2018; Volume 27. [Google Scholar]
  7. Dominici, D. Laguerre–Freud equations for generalized Hahn polynomials of type I. J. Differ. Equ. Appl. 2018, 24, 916–940. [Google Scholar] [CrossRef]
  8. Dominici, D. Matrix factorizations and orthogonal polynomials. Random Matrices Theory Appl. 2020, 9, 2040003. [Google Scholar] [CrossRef]
  9. Dominici, D.; Marcellán, F. Discrete semiclassical orthogonal polynomials of class one. Pac. J. Math. 2012, 268, 389–411. [Google Scholar] [CrossRef]
  10. Dominici, D.; Marcellán, F. Discrete semiclassical orthogonal polynomials of class 2. In Orthogonal Polynomials: Current Trends and Applications; Huertas, E., Marcellán, F., Eds.; SEMA SIMAI Springer Series; Springer: Berlin/Heidelberg, Germany, 2021; Volume 22, pp. 103–169. [Google Scholar]
  11. Clarkson, P.A. Recurrence coefficients for discrete orthonormal polynomials and the Painlevé equations. J. Phys. A Math. Theor. 2013, 46, 185205. [Google Scholar] [CrossRef]
  12. Filipuk, G.; Van Assche, W. Recurrence coefficients of generalized Charlier polynomials and the fifth Painlevé equation. Proc. Am. Math. Soc. 2013, 141, 551–562. [Google Scholar] [CrossRef]
  13. Filipuk, G.; Van Assche, W. Recurrence Coefficients of a New Generalization. of the Meixner Polynomials. Symmetry Integr. Geom. Methods Appl. (SIGMA) 2011, 7, 068. [Google Scholar] [CrossRef]
  14. Filipuk, G.; Van Assche, W. Discrete Orthogonal Polynomials with Hypergeometric Weights and Painlevé VI. Symmetry Integr. Geom. Methods Appl. (SIGMA) 2018, 14, 088. [Google Scholar] [CrossRef]
  15. Christophe Smet and Walter Van Assche, Orthogonal polynomials on a bi-lattice. Constr. Approx. 2012, 36, 215–242. [CrossRef]
  16. Mañas, M.; Fernández-Irrisarri, I. Pearson Equations for Discrete Orthogonal Polynomials: I. Generalized Hypergeometric Functions and Toda Equations. Stud. Appl. Math. 2022, 148, 1141–1179. [Google Scholar] [CrossRef]
  17. Hietarinta, J.; Joshi, N.; Nijhoff, F.W. Discrete Systems and Integrabilty. In Cambridge Texts in Applied Mathematics; Cambridge University Press: Cambridge, UK, 2016. [Google Scholar]
  18. Nijhoff, F.W.; Capel, H.W. The direct linearisation approach to hierarchies of integrable PDEs in 2 + 1 dimensions: I. Lattice equations and the differential-difference hierarchies. Inverse Probl. 1990, 6, 567–590. [Google Scholar] [CrossRef]
  19. Mañas, M. Pearson Equations for Discrete Orthogonal Polynomials: III. Christoffel and Geronimus transformations. Rev. De La Real Acad. De Cienc. Exactas Físicas Y Nat. Ser. A Matemáticas 2022, 116, 168. [Google Scholar] [CrossRef]
  20. Fernández-Irrisarri, I.; Mañas, M. Laguerre–Freud equations for three families of hypergeometric discrete orthogonal polynomials. Stud. Appl. Math. 2023, 151, 509–535. [Google Scholar] [CrossRef]
  21. Magnus, A.P. A proof of Freud’s conjecture about the orthogonal polynomials related to |x|ρexp(−x2m), for integer m. In Orthogonal Polynomials and Applications (Bar-le-Duc, 1984); Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1985; Volume 1171, pp. 362–372. [Google Scholar]
  22. Freud, G. On the coefficients in the recursion formulae of orthogonal polynomials. Proc. R. Ir. Acad. Sect. A 1976, 76, 1–6. [Google Scholar]
  23. Laguerre, E. Sur la réduction en fractions continues d’une fraction qui satisfait à une équation différentialle linéaire du premier ordre dont les coefficients sont rationnels. J. Mathé-Matiques Pures Appliquées 1885, 1, 135–165. [Google Scholar]
  24. Dzhamay, A.; Filipuk, G.; Stokes, A. Recurrence coefficients for dis-crete orthogonal polynomials with hypergeometric weight and discrete Painlevé equations. J. Phys. A Math. Theor. 2020, 53, 495201. [Google Scholar] [CrossRef]
  25. Askey, R.A.; Daalhuis, A.B.O. Generalized hypergeo-metric function. In NIST Handbook of Mathematical Functions; Olver, F.W.J., Lozier, D.M., Boisvert, R.F., Clark, C.W., Eds.; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  26. Hahn, W. Über Orthogonalpolynome, die q-Differenzengleichungen genügen. Math. Nachrichten 1949, 2, 4–34. [Google Scholar] [CrossRef]
  27. Slater, L.J. Generalized Hypergeometric Functions; Cambridge University Press: Cambridge, UK, 1966. [Google Scholar]
  28. Adler, M.; van Moerbeke, P. Vertex operator solutions to the discrete KP hierarchy. Commun. Math. Phys. 1999, 203, 185–210. [Google Scholar] [CrossRef]
  29. Adler, M.; van Moerbeke, P. Generalized orthogonal polynomials, discrete KP and Riemann–Hilbert problems. Commun. Math. Phys. 1999, 207, 589–620. [Google Scholar] [CrossRef]
  30. Adler, M.; van Moerbeke, P. Darboux transforms on band matrices, weights and associated polynomials. Int. Math. Res. Not. 2001, 18, 935–984. [Google Scholar] [CrossRef]
  31. Álvarez-Fernández, C.; Prieto, U.F.; Mañas, M. Multiple orthogonal polynomials of mixed type: Gauss-Borel factorization and the multi-component 2D Toda hierarchy. Adv. Math. 2011, 227, 1451–1525. [Google Scholar] [CrossRef]
  32. Álvarez-Fernández, C.; Ariznabarreta, G.; García-Ardila, J.C.; Mañas, M.; Marcellán, F. Christoffel transformations for matrix orthogonal polynomials in the real line and the non-Abelian 2D Toda lattice hierarchy. Int. Math. Res. Not. 2017, 2017, 1285–1341. [Google Scholar] [CrossRef]
  33. Ariznabarreta, G.; Mañas, M. Matrix orthogonal Laurent polynomials on the unit circle and Toda type in-tegrable systems. Adv. Math. 2014, 264, 396–463. [Google Scholar] [CrossRef]
  34. Mañas, M. Revisiting Biorthogonal Polynomials. An LU factorization discussion. In Orthogonal Polynomials: Current Trends and Applications; Huertas, E., Marcellán, F., Eds.; SEMA SIMAI Springer Series; Springer: Berlin/Heidelberg, Germany, 2021; Volume 22, pp. 273–308. [Google Scholar]
  35. Arvesú, J.; Coussement, J.; Van Assche, W. Some discrete multiple orthogonal polynomials. J. Comput. Appl. Math. 2003, 153, 19–45. [Google Scholar] [CrossRef]
  36. Branquinho, A.; Foulquié-Moreno, A.; Mañas, M. Multiple orthogonal polynomials: Pearson equations and Christoffel formulas. Anal. Math. Phys. 2022, 12, 129. [Google Scholar] [CrossRef]
  37. Mañas, M.; Doliwa, A.; Santini, P.M. Darboux transformations for multidimensional quadrilateral lattices I. Phys. Lett. A 1997, 232, 99–105. [Google Scholar] [CrossRef]
  38. Doliwa, A.; Santini, P.M.; Mañas, M. Transformations of quadrilateral lattices. J. Math. Phys. 2000, 41, 944–990. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Fernández-Irisarri, I.; Mañas, M. Laguerre–Freud Equations for the Gauss Hypergeometric Discrete Orthogonal Polynomials. Mathematics 2023, 11, 4866. https://doi.org/10.3390/math11234866

AMA Style

Fernández-Irisarri I, Mañas M. Laguerre–Freud Equations for the Gauss Hypergeometric Discrete Orthogonal Polynomials. Mathematics. 2023; 11(23):4866. https://doi.org/10.3390/math11234866

Chicago/Turabian Style

Fernández-Irisarri, Itsaso, and Manuel Mañas. 2023. "Laguerre–Freud Equations for the Gauss Hypergeometric Discrete Orthogonal Polynomials" Mathematics 11, no. 23: 4866. https://doi.org/10.3390/math11234866

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop