# On the Connection Coefficients of the Chebyshev-Boubaker Polynomials

Authors: Paul Barry
Journal: The Scientific World Journal
 (2013)

---

## Abstract

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.


---

## Body

## 1. 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–7].IfPn(x) and Qn(x) are two families of orthogonal polynomials, the connection coefficients an,k of Pn in terms of Qn, defined by
(1)Pn=∑k=0n‍an,kQk,
are often of interest. In terms of matrices, we have
(2)P=AQ,
where P is the coefficient array of the polynomials Pn(x), with elements pn,k, and Q is the coefficient array of the polynomials Qn(x), with elements qn,k. Thus, we have
(3)Pn(x)=∑k=0n‍pn,kxk,Qn(x)=∑k=0n‍qn,kxk.
The matrices P and Q are lower-triangular matrices. Clearly, the matrix A of connection coefficients is then given by
(4)A=PQ-1.
We immediately note that
(5)A-1=QP-1,
so that the elements of A-1 are the connection coefficients of Qn in terms of Pn.The matrixA is lower triangular since both P and Q are.We will define a family of orthogonal polynomialsPn(x) to be of Chebyshev-Boubaker type, if the coefficient array P=(pn,k) is a Riordan array of the type
(6)(1+ux+vx21+ax+bx2,λx1+ax+bx2).
This means that
(7)pn,k=[xn]1+ux+vx21+ax+bx2(λx1+ax+bx2)k.
In the case that λ=1, the polynomials are monic. An array of the type
(8)(1+ux+vx21+ax+bx2,λx1+ax+bx2)
will be called a Chebyshev-Boubaker array (with parameters (a,b,u,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 kindUn(x) are defined by
(9)Un(x)=∑k=0⌊n/2⌋‍(-1)k(n-kk)(2x)n-2k
and have coefficient array U given by A053117(10)U=(11+x2,2x1+x2).Example 2.
We letSn(x)=Un(x/2) be the monic Chebyshev polynomials of the second kind. The coefficient array S of these polynomials is given by A049310(11)S=(11+x2,x1+x2).
This is the case u=v=a=0, b=1, and λ=2.
The momentsmn of this family of orthogonal polynomials are the aerated Catalan numbers that begin with
(12)1,0,1,0,2,0,5,0,14,0,42,….
Their moment representation is given by
(13)mn=12π∫-22‍xn4-x2dx.Very often, orthogonal polynomials are specified in terms of the three-term recurrence that they satisfy. In the monic case, this will take the form(14)Pn(x)=(x-αn)Pn-1(x)-βnPn-2(x),
with suitable initial conditions. For instance, we have
(15)Sn(x)=(x-2)Sn-1(x)-Sn-2(x),S0(x)=1,S1(x)=x.
The recurrence coefficients αn and βn for the family Pn of orthogonal polynomials are the entries in the production matrix (or Stieltjes matrix [9]) of the matrix P-1. This production matrix is equal to PP-1¯, where the notation M¯ denotes the matrix M with its first row removed. For instance, the production matrix of U-1=(1/(1+x2),2x/(1+x2))-1 is given by
(16)(0120000⋯12012000⋯01201200⋯00120120⋯00012012⋯⋮⋮⋮⋮⋮⋮⋱),
corresponding to the three-term recurrence
(17)12Un(x)=(x-0)Un-1(x)-12Un-2(x),
or
(18)Un(x)=2xUn-1(x)-Un-2(x).
Similarly, the production matrix of S-1=(1/(1+x2),x/(1+x2))-1 is given by
(19)(010000⋯101000⋯010100⋯001010⋯000101⋯⋮⋮⋮⋮⋮⋮⋱),
corresponding to the three-term recurrence
(20)Sn(x)=xSn-1(x)-Sn-2(x).
More generally, the production matrix of Sb-1=(1/(1+bx2),x/(1+bx2))-1 is given by
(21)(010000⋯b01000⋯0b0100⋯00b010⋯000b01⋯⋮⋮⋮⋮⋮⋮⋱),
corresponding to the three-term recurrence
(22)Sn(b)(x)=xSn-1(b)(x)-bSn-2(b)(x),S0(b)=1,S1(b)(x)=x,
where
(23)Sn(b)(x)=∑k=0⌊n/2⌋‍(n-kk)(-b)kxn-2k.Example 3.
The Boubaker polynomials [8, 10–15] have coefficient array
(24)(1+3x21+x2,x1+x2).
They can be expressed as
(25)Pn(x)=∑k=0⌊n/2⌋‍(n-kk)n-4kn-k(-1)kxn-2k.
We have
(26)(1+3x21+x2,x1+x2)-1=(1+x2c(x2)21+3x2c(x2)2,xc(x2))=(11+2x2c(x2),xc(x2)),
where
(27)c(x)=1-1-4x2x
is the generating function of the Catalan numbers
(28)Cn=1n+1(2nn).
Hence, the moments mn of this family of orthogonal polynomials have g.f. 1/(1+2x2c(x2)). The sequence mn begins with
(29)1,0,-2,0,2,0,-4,0,2,0,-12,0,-12,0,-72,…
and has the moment representation
(30)mn=-1π∫-22‍xn4-x24+3x2dx+23(-23i)n+23(23i)n.
We have
(31)m2n=∑k=0n‍k+0n+kn+0nk(2n-k-1n-k)(-2)k=∑k=0n‍2k+1n+k+1(2nn-k)(-3)k.
The sequence m2n is A126984. We note that the Hankel transforms of mn and m2n are both equal to (-2)n. The production matrix of ((1+3x2)/(1+x2),x/(1+x2))-1 is given by
(32)(010000⋯-201000⋯010100⋯001010⋯000101⋯⋮⋮⋮⋮⋮⋮⋱).In this paper, we will give a closed-form expression for the connection coefficients of the Chebyshev-Boubaker polynomialsPn(x) with coefficient array
(33)P=(1+ux+vx21+ax+bx2,x1+ax+bx2)
in terms of the Chebyshev-Boubaker polynomials Qn(x) with coefficient array
(34)Q=(1+sx+tx21+cx+dx2,x1+cx+dx2).
We note that the polynomials Pn(x) satisfy the recurrence
(35)Pn(x)=(x-a)Pn-1(x)-bPn-2(x),n≥3,
with
(36)P0(x)=1,P1(x)=x+u-a,P2(x)=x2+(u-2a)x-ua+a2+v-b,
with a similar expression for Qn(x).In the next section, we recall notational elements that we will use in the sequel, along with a brief introduction to Riordan arrays.


## 2. 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 sequencean, that is, an element of ℤℕ, the power series f(x)=∑n=0∞‍anxn is called the ordinary generating function or g.f. of the sequence. an is thus the coefficient of xn in this series. We denote this by an=[xn]f(x). For instance, Fn=[xn](x/(1-x-x2)) is the nth Fibonacci number A000045, while Cn=[xn]((1-1-4x)/2x) is the nth Catalan number A000108. We use the notation 0n=[xn]1 for the sequence 1,0,0,0,…,  A000007. Thus, 0n=[n=0]=δn,0=(0n). Here, we have used the Iverson bracket notation [16], defined by [𝒫]=1 if the proposition 𝒫 is true and [𝒫]=0 if 𝒫 is false.For a power seriesf(x)=∑n=0∞‍anxn with f(0)=0, we define the reversion or compositional inverse of f to be the power series f¯(x) such that f(f¯(x))=x.For a lower triangular matrix(an,k)n,k≥0, the row sums give the sequence with general term ∑k=0n‍an,k. For a sequence an, the sequence of determinants |ai+j|0≤i,j≤n is called the Hankel transform of an [17–27].TheRiordan group [28, 29] is a set of infinite lower-triangular integer matrices, where each matrix is defined by a pair of generating functions g(x)=1+g1x+g2x2+⋯ and f(x)=f1x+f2x2+⋯ where f1≠0 [29]. We often require in addition that f1=1. The associated matrix is the matrix whose ith column is generated by g(x)f(x)i (the first column being indexed by 0). The matrix corresponding to the pair g,f is denoted by (g,f) or ℛ(g,f). The group law is then given by
(37)(g,f)·(h,l)=(g,f)(h,l)=(g(h∘f),l∘f).
The identity for this law is I=(1,x), and the inverse of (g,f) is
(38)(g,f)-1=(1g∘f¯,f¯),
where f¯ is the compositional inverse of f.IfM is the matrix (g,f) and a=(a0,a1,…)T is an integer sequence (expressed as an infinite column vector) with ordinary generating function 𝒜(x), then the sequence Ma has ordinary generating function g(x)𝒜(f(x)). The (infinite) matrix (g,f) can thus be considered to act on the ring of integer sequences ℤℕ by multiplication, where a sequence is regarded as a (infinite) column vector. We can extend this action to the ring of power series ℤ[[x]] by
(39)(g,f):𝒜(x)↦(g,f)·𝒜(x)=g(x)𝒜(f(x)).Example 4.
The so-calledbinomial matrixB is the element (1/(1-x),x/(1-x)) of the Riordan group. It has general element (nk) and hence as an array coincides with Pascal's triangle. More generally, Bm is the element (1/(1-mx),x/(1-mx)) of the Riordan group, with general term (nk)mn-k. It is easy to show that the inverse B-m of Bm is given by (1/(1+mx),x/(1+mx)).The row sums of the matrix(g,f) have generating function
(40)(g,f)·11-x=g(x)1-f(x).Example 5.
The inverse of the Riordan array(1/(1+x),x/(1+x)2) is the Riordan array (c(x),xc(x)2). This follows since the solution of the equation
(41)z(1+z)2=x
is given by
(42)z=xc(x)2.
We then have
(43)1+xc(x)2=c(x).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 B (“Pascal's triangle”) is A007318.For an invertible matrixM, its production matrix (also called its Stieltjes matrix) [32, 33] is the matrix
(44)𝒮M=M-1M¯,
where M¯ is the matrix M with its first row removed. A Riordan array M is the inverse of the coefficient array of a family of orthogonal polynomials [34–36] if and only if 𝒮M 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.Example 6.
The production matrix of(c(x),xc(x)2) is given by
(45)(110000⋯121000⋯012100⋯001210⋯000121⋯000012⋯⋮⋮⋮⋮⋮⋮⋱).An important feature of Riordan arrays is that they have a number of sequence characterizations [37, 38]. The simplest of these is as follows.Proposition 7 (see [38], Theorems 2.1, and 2.2).
LetD=[dn,k] be an infinite triangular matrix. Then, D is a Riordan array if and only if there exist two sequences A=[α0,α1,α2,…] and Z=[z0,z1,z2,…] with α0≠0, z0≠0 such that  (i)
dn+1,k+1=∑j=0∞‍αjdn,k+j, (k,n=0,1,…);(ii)
dn+1,0=∑j=0∞‍zjdn,j, (n=0,1,…).The coefficientsα0,α1,α2,… and z0,z1,z2,… are called the A-sequence and the Z-sequence of the Riordan array M=(g(x),f(x)), respectively. Letting A(x) be the generating function of the A-sequence and Z(x) the generating function of the Z-sequence, we have
(46)A(x)=xf¯(x),Z(x)=1f¯(x)(1-d0,0g(f¯(x))).The first column of𝒮M is then generated by Z(x), while the kth column is generated by xk-1A(x) (taking the first column to be indexed by 0).Proposition 8.
The inverse of the Chebyshev-Boubaker array(47)P=(1+ux+vx21+ax+bx2,11+ax+bx2)-1
has production matrix which begins with
(48)(a-u10000⋯b-va1000⋯0ba100⋯00ba10⋯000ba1⋯0000ba⋯⋮⋮⋮⋮⋮⋮⋱).Proof.
We letM=(g(x),f(x))=P-1. Then,
(49)A(x)=xf¯(x)=xx/(1+ax+bx2)=1+ax+bx2.
We also have
(50)Z(x)=1+ax+bx2x(1-1+ux+vx21+ax+bx2)=(a-u)+(b-v)x,
which proves the assertion.


## 3. Chebyshev-Boubaker Arrays

We can characterize the Chebyshev-Boubaker polynomialsPn(x) with coefficient array P=((1+ux+vx2)/(1+ax+bx2),λx/(1+ax+bx2)) as follows.Proposition 9 (see [8]).
The Chebyshev-Boubaker coefficient array((1+ux+vx2)/(1+ax+bx2),λx/(1+ax+bx2)) is the coefficient array of the generalized Chebyshev polynomials Pn(x) of the second kind given by
(51)Pn(x)=(b)nUn(λx-a2b)+u(b)n-1Un-1(λx-a2b)+v(b)n-2Un-2(λx-a2b).The following variant is also true. The array((1+ux+vx2)/(1+λax+bx2),λx/(1+λax+bx2)) is the coefficient array of the generalized Chebyshev polynomials of the second kind Pn(λ)(x) given by
(52)Pn(λ)(x)=(b)nUn(λ(x-a)2b)+u(b)n-1Un-1×(λ(x-a)2b)+v(b)n-2Un-2(λ(x-a)2b).The following factorization of the Chebyshev-Boubaker array will be useful when it comes to giving a closed-form expression for the connection coefficients.Proposition 10.
(The canonical factorization of Chebyshev-Boubaker arrays). Given the Chebyshev-Boubaker array(53)P=(1+ux+vx21+aλx+bx2,λx1+aλx+bx2),
one has
(54)P=(1+ux+vx2,x)·(11+bx2,λx1+bx2)·(11+ax,x1+ax).Proof.
The proof is a straight-forward application of the multiplication rule for Riordan arrays. For instance, we have(55)(11+bx2,λx1+bx2)·(11+ax,x1+ax)=(11+bx211+aλx/(1+bx2),λx/(1+bx2)1+aλx/(1+bx2))=(11+aλx+bx2,λx1+aλx+bx2).For the monic caseλ=1, we have
(56)(1+ux+vx21+ax+bx2,x1+ax+bx2)=(1+ux+vx2,x)·(11+bx2,x1+bx2)·(11+ax,x1+ax).Corollary 11.
If(57)P=(1+ux+vx21+aλx+bx2,λx1+aλx+bx2),
then
(58)P-1=(11-ax,x1-ax)·(c(bx2),1λxc(bx2))·(11+ax+bx2,x).In the monic caseλ=1, we then have
(59)(1+ux+vx21+ax+bx2,x1+ax+bx2)-1=(11-ax,x1-ax)·(c(bx2),xc(bx2))·(11+ax+bx2,x).
We can characterize the Jacobi coefficients of Pn(x) in terms of those of Qn(x) as follows. We let 𝒮P=PP-1¯ be the production matrix of P-1, and we let 𝒮Q=QQ-1¯ be the production matrix of Q-1. We then have the following proposition.Proposition 12.
One has,(60)𝒮P=A𝒮QA-1.Proof.
We have𝒮P=PP-1¯=P𝕊P-1, where 𝕊 is the shift matrix with ones on the super-diagonal and zeros elsewhere, with a similar expression for 𝒮Q. We then have
(61)𝒮P=P𝕊P-1=AQ𝕊(AQ)-1=AQ𝕊Q-1A-1=A𝒮QA-1.


## 4. The Chebyshev-Boubaker Connection Coefficients

We let(62)P=(1+ux+vx21+ax+bx2,x1+ax+bx2),Q=(1+sx+tx21+cx+dx2,x1+cx+dx2).
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)P=(1+ux+vx2,x)·(11+bx2,x1+bx2)·(11+ax,x1+ax),Q-1=(11-cx,x1-cx)·(c(dx2),xc(dx2))·(11+sx+tx2,x).
We now proceed to list the elements of the factors involved. The matrix (1/(1+ax),x/(1+ax)) is the generalized inverse binomial matrix with general element
(64)(11+ax,x1+ax)=((nk)(-a)n-k)0≤n,k≤∞.
The matrix (1/(1+bx2),x/(1+bx2)) gives the coefficients of the Chebyshev polynomials Un(bx). We have
(65)(11+bx2,x1+bx2)=((n+k2k)(-b)(n-k)/21+(-1)n-k2)0≤n,k≤∞.
The matrix (1+ux+vx2,x) is the banded matrix with the elements (1,u,v) occupying the three diagonals from the main diagonal down (with zeros elsewhere). The elements of the matrix product (1+ux+vx2,x)·(1/(1+bx2),x/(1+bx2)) are then given by
(66)(n+k2k)(-b)(n-k)/21+(-1)n-k2+u(n+k-12k)(-b)(n-k-1)/21-(-1)n-k2+v(n+k-22n-k-22)(-b)(n-k-2)/21+(-1)n-k2.
Let us denote these elements by Tn,k. Then, the matrix P has elements given by
(67)pn,k=∑j=0n‍Tn,j(j-kk)(-a)j-k.
A similar analysis of the factors in the expression for Q-1 shows that the general element of Q-1 is given by
(68)qn,k*=∑i=0n‍∑j=0n‍(nj)cn-ji+1j+1(j+1j-i2)×d(j-i)/21+(-1)j-i2∑r=0⌊(i-k)/2⌋‍(i-k-rr)×(-s)i-k-r(-t)r,
since we have
(69)(11-cx,x1-cx)=((nk)cn-k)0≤n,k≤∞,(c(dx2),xc(dx2))=(k+1n+1(n+1n-k2)d(n-k)/21+(-1)n-k2)0≤n,k≤∞,(11+sx+tx2,x)=(∑j=0⌊(n-k)/2⌋‍(n-k-jj)(-s)n-k-j(-t)j)0≤n,k≤∞.
We gather our results in the following proposition.Proposition 13.
Let(70)P=(1+ux+vx21+ax+bx2,x1+ax+bx2),Q=(1+sx+tx21+cx+dx2,x1+cx+dx2)
be the coefficient arrays of two families of Chebyshev-Boubaker polynomials. Then, the connection coefficients an,k for Pn in terms of Qn are given by
(71)an,k=∑j=0n‍pn,jqj,k*,
where
(72)pn,k=∑j=0n‍Tn,j(j-kk)(-a)j-k,
with Tn,k given by the expression
(73)(n+k2k)(-b)(n-k)/21+(-1)n-k2+u(n+k-12k)(-b)(n-k-1)/21-(-1)n-k2+v(n+k-22n-k-22)(-b)(n-k-2)/21+(-1)n-k2,qn,k*=∑i=0n‍∑j=0n‍(nj)cn-ji+1j+1(j+1j-i2)×d(j-i)/21+(-1)j-i2∑r=0⌊(i-k)/2⌋‍(i-k-rr)×(-s)i-k-r(-t)r.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𝒮A, the production matrix of A.Proposition 14.
LetA be the matrix of connection coefficients that express the polynomials Pn(x) with coefficient array P in terms of the polynomials Qn(x) with coefficient array Q. Then, one has
(74)𝒮A=Q𝒮PQ-1.Proof.
We have(75)𝒮A=A-1𝕊A=(PQ-1)-1𝕊(PQ-1)=QP-1𝕊PQ-1=Q𝒮PQ-1.Proposition7 can now be interpreted in this context as follows, giving a set of recurrence relations for the connection coefficients.Proposition 15.
If theA and Z sequences of 𝒮A are denoted, respectively, by αn and zn, then the connection coefficients an,k satisfy the following recurrences
(76)an+1,k+1=∑j=0n-k‍αjan,k+j,an+1,0=∑j=0n‍zjan,j.


## 5. 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, letP=S, the coefficient array of the monic Chebyshev polynomials of the second kind. We have
(77)S=(11+x2,x1+x2).
We will have
(78)Q=(11+x,x(1+x)2).
This is the array of the Morgan-Voyce polynomials Bn(x)=∑k=0n‍(n+k2k)(-1)n-kxk. Then,
(79)A=SQ-1=(11+x2,x1+x2)·(11+x,x(1+x)2)-1=(11+x2,x1+x2)·(c(x),xc(x)2).
This implies that
(80)A=(11+x2c(x1+x2),x1+x2c(x1+x2)2).
The matrix A begins with
(81)(100000⋯110000⋯131000⋯375100⋯91917710⋯2557553191⋯⋮⋮⋮⋮⋮⋮⋱).
The first column terms an=an,0 have generating function
(82)11+x2c(x1+x2)=1+x2-1-4x+2x2-4x3+x42x(1+x2).
This form of g.f. suggests that this sequence may have an interesting Hankel transform. In fact, the sequence an,0 is A101499, a sequence which gives the number of peakless Motzkin paths of length n in which the (1,0)-steps at levels greater than level 0 come in two colors (Emeric Deutsch). The Hankel transform of an,0 starts with
(83)1,0,-4,-16,-64,0,4096,65536,1048576,0,-1073741824,….
This is A162547, which is a Somos-4 variant [27, 39] in the sense that we have
(84)an=(4an-1an-3-4an-22)an-4,(n≠4k+1).
We have
(85)an,k=∑j=0n-k‍∑i=0⌊j/2⌋‍(-1)i(j-ii)Cj-2i(n-j-1n-k-j)2n-k-j.
We note that due to the combinatorial interpretation of an,0 and the positivity of the Catalan numbers, we can conclude that all the connection coefficients an,k are positive in this case.We now find expressions for the elementsαn and zn of the production matrix 𝒮A of A.We use the values(86)g(x)=11+x2c(x1+x2)=1+x2-1-4x+2x2-4x3+x42x(1+x2),f(x)=x1+x2c(x1+x2)2=(1-x)2-1-4x+2x2-4x3+x42x,
along with (46) to find that
(87)Z(x)=1-4x+2x2-4x3+x4+x2-12x,A(x)=(1+x)2+1-4x+2x2-4x3+x42.
This implies that
(88)zn=(1n)-∑k=0⌊(n-1)/2⌋‍1k+1(n-k-2k)×(n-k-1k)(-2)n-1-2k,αn=(2n)-∑k=0⌊(n-2)/2⌋‍1k+1(n-k-3k)×(n-k-2k)(-2)n-2-2k.
With these values for zn and αn, we thus obtain the following recurrences for the connection coefficients:
(89)an+1,k+1=∑j=0n-k‍αjan,k+j,(k,n=0,1,…),an+1,0=∑j=0n‍zjan,j,(n=0,1,…).
We note that, in this case, the sequence elements αn and zn are essentially diagonal sums of generalized Narayana triangles [40].Example 17.
In this example, we letPn be the family of orthogonal polynomials with the Catalan numbers Cn as moments, and we let Qn be the family of orthogonal polynomials with the central binomial coefficients (2nn)  A000984 as moments. We find that
(90)P=(11+x2,x1+x2),Q=(1-x1+x2,x1+x2).
We obtain
(91)A=PQ-1=(11-x,x),
which is the partial sum matrix (the lower-triangular matrix all of whose nonzero elements are 1). This corresponds to
(92)Pn(x)=∑k=0n‍Qk(x).
In fact, we have
(93)Qn(x)=(n+kn-k)(-1)n-k-(n+k-1n-k-1)(-1)n-k-1,Pn(x)=(n+kn-k)(-1)n-k=(n+k2k)(-1)n-k=∑k=0n‍Qk(x).Example 18.
LetPn(x)=Sn(x), the monic Chebyshev polynomials of the second kind with the aerated Catalan numbers as moments, and let Qn(x) be the family of orthogonal polynomials with (2nn) as moments. We get
(94)A=(11+x2,x1+x2)·(1-x1+x,x(1+x)2)-1=(11+x2,x1+x2)·(11-4x,xc(x)2)=(11+x211-4(x/(1+x2)),x1+x2c(x1+x2)2)=((1-x)2-1-4x+2x2-4x3+x42x11-4x+2x2-4x3+x4,(1-x)2-1-4x+2x2-4x3+x42x).
The sequence an=an,0 is then A101500, with
(95)an=∑k=0⌊n/2⌋‍(n-kk)(2(n-2k)n-2k)(-1)k.
In this example, we have
(96)Q-1=(1-x1+x,x(1+x)2)-1=((2nn-k)),
which is A094527. Hence, we have
(97)an,k=∑j=0n‍(n+j2j)(-1)(n-j)/21+(-1)n-j2(2jj-k).
Note that this implies that
(98)an=∑j=0n‍(n+j2j)(-1)(n-j)/21+(-1)n-j2(2jj).Example 19.
In this final example, we letP be the coefficient array of the Boubaker polynomials. Thus,
(99)P=(1+3x21+x2,x1+x2).
We recall that the Boubaker polynomials can be expressed as
(100)Pn(x)=∑k=0⌊n/2⌋‍(n-kk)n-4kn-k(-1)kxn-2k.
We let Q be the coefficient array of the Morgan-Voyce polynomials
(101)Qn(x)=∑k=0n‍(n+k2k)(-1)n-kxk.
Then,
(102)Q=(11+x,x(1+x)2).
The connection coefficients of the Boubaker polynomials in terms of the Morgan-Voyce polynomials are the elements of the array
(103)A=(1+3x21+x2,x1+x2)·(11+x,x(1+x)2)-1.
Thus,
(104)A=((1+3x2)(1+x2-1-4x+2x2-4x3+x4)2x(1+x2),(1-x)2-1-4x+2x2-4x3+x42x(1+3x2)(1+x2-1-4x+2x2-4x3+x4)2x(1+x2)).
Letting
(105)Tn,k=∑j=0n-k‍∑i=0⌊j/2⌋‍(-1)i(j-ii)Cj-2i(n-j-1n-k-j)2n-k-j,
(see (85)), we obtain
(106)an,k=Tn,k+3Tn-2,k.
Again, we see that all the coefficients an,k are positive.


## 6. 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.



---

*Source: 657806-2013-08-04.xml*