On the Connection Coefficients of the Chebyshev-Boubaker Polynomials

The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection coefficients as well as recurrence relations that define them.


Introduction
In this paper, we will show that the usual recurrence relations that define elements of Riordan arrays can be used to give a set of recurrence relations for the connection coefficients of families of orthogonal polynomials defined by Riordan arrays. It will also be seen that we can give closed-form expressions for the connection coefficients themselves, at least so far, as it is easy to give closed-form expressions for the Riordan arrays concerned. Thus, in the special case of orthogonal polynomials that are defined by Riordan arrays, we can achieve two of the main goals involved in the study of connection coefficients for orthogonal polynomials [1][2][3][4][5][6][7].
If ( ) and ( ) are two families of orthogonal polynomials, the connection coefficients , of in terms of , defined by are often of interest. In terms of matrices, we have where P is the coefficient array of the polynomials ( ), with elements , , and Q is the coefficient array of the polynomials ( ), with elements , . Thus, we have The matrices P and Q are lower-triangular matrices. Clearly, the matrix A of connection coefficients is then given by We immediately note that so that the elements of A −1 are the connection coefficients of in terms of . The matrix A is lower triangular since both P and Q are. We will define a family of orthogonal polynomials ( ) to be of Chebyshev-Boubaker type, if the coefficient array P = ( , ) is a Riordan array of the type This means that In the case that = 1, the polynomials are monic. An array of the type 2 The Scientific World Journal will be called a Chebyshev-Boubaker array (with parameters ( , , , V, )). This is a generalization of the notion of a Chebyshev-Boubaker array considered in [8]. The Boubaker polynomials [8] correspond to the parameters (0, 1, 0, 3, 1).

Example 1.
The Chebyshev polynomials of the second kind ( ) are defined by and have coefficient array U given by A053117 Example 2. We let ( ) = ( /2) be the monic Chebyshev polynomials of the second kind. The coefficient array S of these polynomials is given by A049310 This is the case = V = = 0, = 1, and = 2.
In this paper, we will give a closed-form expression for the connection coefficients of the Chebyshev-Boubaker polynomials ( ) with coefficient array in terms of the Chebyshev-Boubaker polynomials ( ) with coefficient array We note that the polynomials ( ) satisfy the recurrence with 0 ( ) = 1, 1 ( ) = + − , with a similar expression for ( ).
In the next section, we recall notational elements that we will use in the sequel, along with a brief introduction to Riordan arrays.

Preliminaries on Integer Sequences and Riordan Arrays
In this section, we define terms used later to discuss integer sequences, Riordan arrays, production matrices, orthogonal polynomials, and Hankel transforms. Readers familiar with these areas and the links between them may skip this section.
For an integer sequence , that is, an element of Z N , the power series ( ) = ∑ ∞ =0 is called the ordinary generating function or g.f. of the sequence.
The Riordan group [28,29] is a set of infinite lowertriangular integer matrices, where each matrix is defined by a pair of generating functions ( ) = 1 . We often require in addition that 1 = 1. The associated matrix is the matrix whose th column is generated by ( ) ( ) (the first column being indexed by 0). The matrix corresponding to the pair , is denoted by ( , ) or R( , ). The group law is then given by The identity for this law is = (1, ), and the inverse of ( , ) is where is the compositional inverse of . If M is the matrix ( , ) and a = ( 0 , 1 , . . . ) is an integer sequence (expressed as an infinite column vector) with ordinary generating function A( ), then the sequence Ma has ordinary generating function ( )A( ( )). The (infinite) matrix ( , ) can thus be considered to act on the ring of integer sequences Z N by multiplication, where a sequence is regarded as a (infinite) column vector. We can extend this action to the ring of power series Z The row sums of the matrix ( , ) have generating function Example 5. The inverse of the Riordan array (1/(1+ ), /(1+ ) 2 ) is the Riordan array ( ( ), ( ) 2 ). This follows since the solution of the equation is given by We then have Many interesting examples of sequences and Riordan arrays can be found in Neil Sloane's On-Line Encyclopedia of Integer Sequences (OEIS), [30,31]. Sequences are frequently referred to by their OEIS number. For instance, the binomial matrix ("Pascal's triangle") is A007318.
For an invertible matrix , its production matrix (also called its Stieltjes matrix) [32,33] is the matrix where is the matrix with its first row removed. A Riordan array is the inverse of the coefficient array of a family of orthogonal polynomials [34][35][36] if and only if S is tridiagonal [8,17]. Necessarily, the Jacobi coefficients (i.e., the coefficients of the three-term recurrence [34] that defines the polynomials) of these orthogonal polynomials are then constant.
An important feature of Riordan arrays is that they have a number of sequence characterizations [37,38]. The simplest of these is as follows. The coefficients 0 , 1 , 2 , . . . and 0 , 1 , 2 , . . . are called the -sequence and the -sequence of the Riordan array = ( ( ), ( )), respectively. Letting ( ) be the generating function of the -sequence and ( ) the generating function of the -sequence, we have ) . (46) The first column of S is then generated by ( ), while the th column is generated by −1 ( ) (taking the first column to be indexed by 0).

Proposition 10. (The canonical factorization of Chebyshev-Boubaker arrays). Given the Chebyshev-Boubaker array
one has Proof. The proof is a straight-forward application of the multiplication rule for Riordan arrays. For instance, we have For the monic case = 1, we have Corollary 11. If then In the monic case = 1, we then have We can characterize the Jacobi coefficients of ( ) in terms of those of ( ) as follows. We let S = PP −1 be the production matrix of P −1 , and we let S = QQ −1 be the production matrix of Q −1 . We then have the following proposition. (61)

The Chebyshev-Boubaker Connection Coefficients
We let For the matrix of connection coefficients A, we recall that we have A = PQ −1 . Now, P and Q −1 have the following factorizations: (63) 6 The Scientific World Journal We now proceed to list the elements of the factors involved. The matrix (1/(1 + ), /(1 + )) is the generalized inverse binomial matrix with general element The matrix (1/(1 + 2 ), /(1 + 2 )) gives the coefficients of the Chebyshev polynomials ( √ ). We have The matrix (1 + + V 2 , ) is the banded matrix with the elements (1, , V) occupying the three diagonals from the main diagonal down (with zeros elsewhere). The elements of the matrix product (1 + + V 2 , )⋅(1/(1+ 2 ), /(1 + 2 )) are then given by Let us denote these elements by , . Then, the matrix P has elements given by A similar analysis of the factors in the expression for Q −1 shows that the general element of Q −1 is given by * since we have We gather our results in the following proposition.

Proposition 13. Let
be the coefficient arrays of two families of Chebyshev-Boubaker polynomials. Then, the connection coefficients , for in terms of are given by where with , given by the expression The Scientific World Journal 7 The connection coefficient elements in the Chebyshev-Boubaker class of polynomials are given by Riordan arrays. The elements of these arrays can be expressed in terms of recurrences defined by the associated production matrices. Thus, we are naturally interested in the structure of S A , the production matrix of A. Proposition 14. Let A be the matrix of connection coefficients that express the polynomials ( ) with coefficient array P in terms of the polynomials ( ) with coefficient array Q. Then, one has Proof. We have Proposition 7 can now be interpreted in this context as follows, giving a set of recurrence relations for the connection coefficients.

Examples
In this section, we give examples of the foregoing, using simple examples that are close to the Chebyshev polynomials of the second kind. This enables us to illustrate the theory without an unnecessarily high overhead.
Example 16. We take the example of the families of orthogonal polynomials that have the aerated Catalan and the ordinary Catalan numbers as moments, respectively. Thus, let P = S, the coefficient array of the monic Chebyshev polynomials of the second kind. We have We will have This is the array of the Morgan-Voyce polynomials ( ) = ∑ =0 ( + 2 ) (−1) − . Then, This implies that The matrix A begins with ) . (81) The first column terms = ,0 have generating function This is A162547, which is a Somos-4 variant [27,39] in the sense that we have We have We note that due to the combinatorial interpretation of ,0 and the positivity of the Catalan numbers, we can conclude that all the connection coefficients , are positive in this case.

8
The Scientific World Journal We now find expressions for the elements and of the production matrix S A of A.
We use the values along with (46) to find that This implies that With these values for and , we thus obtain the following recurrences for the connection coefficients: We note that, in this case, the sequence elements and are essentially diagonal sums of generalized Narayana triangles [40].
Example 17. In this example, we let be the family of orthogonal polynomials with the Catalan numbers as moments, and we let be the family of orthogonal polynomials with the central binomial coefficients ( 2 ) A000984 as moments. We find that P = ( 1 1 + 2 , 1 + 2 ) , We obtain which is the partial sum matrix (the lower-triangular matrix all of whose nonzero elements are 1). This corresponds to In fact, we have The sequence = ,0 is then A101500, with In this example, we have which is A094527. Hence, we have The Scientific World Journal 9 Example 19. In this final example, we let P be the coefficient array of the Boubaker polynomials. Thus, P = ( 1 + 3 2 1 + 2 , 1 + 2 ) .
We recall that the Boubaker polynomials can be expressed as We let Q be the coefficient array of the Morgan-Voyce polynomials Then, The connection coefficients of the Boubaker polynomials in terms of the Morgan-Voyce polynomials are the elements of the array A = ( 1 + 3 2 1 + 2 , 1 + 2 ) ⋅ ( (104) (see (85)), we obtain , = , + 3 −2, .
Again, we see that all the coefficients , are positive.

Conclusions
We have shown that in the case of orthogonal polynomials defined by Riordan arrays, we can give both closed form expressions and recurrence relations for the connection coefficients, using the machinery from the theory of Riordan arrays.