Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
43 views10 pages

Exponential Generating Functions For Pell Polynomials

Download as pdf or txt
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 10

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS

Catholic

BRO. J. M. MAHON
of Education,
Sydney,

College

A. F. HORADAM
of New England, Armidale,

University

(Submitted

March

Australia
Australia

2154
2351

1985)

1 , INTRODUCTION
Following our description [6] of the properties of the ordinary generating
functions of Pell polynomials Pn (x) and Pell-Lucas polynomials Qn(x) [3], we
offer here a compact exposition of similar properties of the exponential generating functions of these polynomials.
Earlier authors have written about the exponential generating functions of
the Fibonacci numbers [2] and of generalized Fibonacci numbers [7].
Details of the main properties of the Pell-type polynomials may be found
in [3] and [4], and will be assumed, where necessary. For visual simplicity,
we will abbreviate the functional notation thus: Pn (x) E Pn 9 Qn(x) E Qn.
Binet forms of Pn and Qn are
n
n
P- = (a - 3 )/(a

and

(1.1)

3)

= an + 6 n ,

where

(1.2)

(a = x + Vx2 + 1
(1.3)

(3 = x - Vx2 + 1
1, a - 3 = 2y/x2 + 1)

(so a + 3 = 2x9 a3
are the roots of
X2 - 2xX ~ I = 0 .

(1.4)

Some symbolism we shall employ include:

z2Y

V = (1 - 2xz

(= A in [6] with y replaced by z)


2

= (1 - Q z + (-l)^ )"
f

v = (1 + 2xz
V (2) ;

P =

P71 =

2x
1

(1.6)

i.e., V(1) E V

i.e., replace z by -z
* )A^2) in [6] with y replaced by z
2

(1.5)

in (1.5)

(1.7)
(1.8)
(1-9)

(1.10)

Usage of the matrix P (1.9) is to be found, for example, in [3], [4], [5],
and [6]. Inevitably, some of the simpler results for Pell-type polynomials in
the ensuing pages may have been obtained by other methods in our papers listed
as references.

194

[Aug.

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


2.

BASIC MATERIAL

Write

*..<-4^-

and

0) = eay

Q(x9 y9

+ e** =

(2.1)

QTyT
- ~

(2.2)

3oth (2.1) and (2.2) satisfy


d2t

2x

3z/2

t = 0.

(2.3)

dy

From (2.1)
P

P(x, i/,fc)= 3 - ^ P(x, z/, 0) =

fe^

r+

(2.4)

whence
y9 n + 1) - 2xP(x9

P(x,

y9 n - 1) = 0.

y9 ri) - P(x9

(2.5)

Also
Q(xs

y9 k) = r

$(a:5

z/9 n + 1) - 2xQ(x9

d7/

whence

Q(x9 y9

0) =

(2.6)

" ^x 3 7 ,

r =0

'

y9 ri) - Q(x9 y9 n - 1) = 0.

(2.7)

Formulas (2.5) and (2.7) suggest the matrix representations:


1)

P(x9

y9 ri)

P(x9

y9

P(x9

y9 n - 1)_

P(x9

y9 0)_

(2.8)

Q(x9 y9

}(x9 y9 ri)

1)
(2.9)

\_Q(x5 y9 n - 1)J

Q(x9 y9 0)J
>(*, z/, 1)"

P(x9

y9 n) = [1

Q(x9 y9 ri) = [1
3.

(2.10)

0]P

P(x9

y9 0)J

^(x3

z/s 1)
(2.11)

0]P

.(#, z/, o ) j

PROPERTIES OF EXPONENTIAL GENERATING FUNCTIONS

First9 from (2.4) and (2.1) or by matricess


P(x5

y9 n + 1) -f- P(x9

ys

5-ieei/

n - 1)

(3.1)
= (x5 2/,

ri)

by (2.6)

whiles similarly,

1987]

195

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


Q(x9 y9 n + 1) + Q(x9 y9 n - 1) = k(x2

+ l)P(x5

y9 n ) .

(3.2)

Generalizations, with variations, of (3.1) and (3.2) are:


n + P ) + (-l)rP(x9

n - p) = pP(ar, z/, n)

(3.3)

P(tf, 2/, n + P ) - (-l) P(x, y9 n - p) = Pp(x, z/, n)

(3.4)

P(x9

y,

y,

n + p) + (-l) (a;, z/, w - P ) = QrQ(x9

y,

(3.5)

y9 n)

Q(x9 y9 n + P ) - (-l) 0, 2/, - p) = 4(^c + l)PrP(a;, y9 n)

(3.6)

An elementary property is, by (2.1), (2.6), and (2.4),


P(x9

y9 n)Q(x9

y9 ri) = P(x,

2y 9 2ri)/2n.

(3.7)

Combining (3.3) and (3.4) with (3.7), we arrive at:


P2(x9

y9 n + p) - P 2 (x, y9 n - r)
(#, y9 n - r)

" (#, i/, n + p)

=P

P(x9

2y9 2n)/2n

= 4(x + l)P2pP(rrj, 2z/, 2n)/2

For v a r i e t y , we u s e m a t r i c e s t o d e m o n s t r a t e t h e Simson
P(x9 y9 ri) . D e t a i l s a r e :
P(x9

y9n

+ l)P(x9

y9 n - 1) - P (x9 y9

\P(x9

y9 n + 1)

P(JJ,

y9 ri)

\P(x9

y9 n)

P(x9

y9 n - I) ,

P(x9

Pn

y9

P(x9

1)

y9

(3.8)

formula

(3.9)

(3.10)

for

(3.10)

ri)

1)
by ( 2 . 8 )

[ P C c 2/, 0 ) J
= (-l)r

\P(x9

y9

|_PGc y>
2)

0)J

PGc, z/, 1)
by ( 2 . 8 )

\P(x9

y9

1)

[ Ip^" ] = ( - l ) " " ]

P(a;, 2/, 0)

= (-l)n-1{(a2ea^-B2e3y)(ea2'-e^)-

(aea^-

^ ) 2 } / ( a - B)s

by ( 2 . 1 )
and ( 2 . 4 )

= (-l)n_:L{-(a2 + 32 - 2ag)e(a + ^ } / ( a - 3)2


= {~l)ne2xy

by ( 1 . 3 )

Likewise,
Q(x9 y9 n + l)S(a;, z/, n - 1) - Q2(x9
= (-l)

n_1

4(x

+ l)e

2xy

y9

ri)

(3.11)

The clear similarity of the results in this section with the corresponding
formulas for Pn and Qn is noticeable.
Obviously, the number of relationships involving exponential generating
functions themselves alone is extensive. Three such are, for example:
P(x9 y9 n)P(xs
y9 r + 1) + P(x9
= P(x9 2y9 n + p)/2 n +r;

y9n~

l)P(x9

Q(x9 ys n)Q(x9 y9 v + 1) + Q(x9 y9 n - l)Q(x9


= 40r2 + l)P(x9
2y9 n + p)/2 n +r ;

y9

r)
(3.12)

y9 P )
(3.13)

and
196

[Aug.

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


P(x9 y9 n)Q(x9 y9 v + 1) + P(x9
= Q(x9 2y9 n + r)/2n + 2\

n - l)Q(x9

y, r)
(3.14)

Put r = n - 1 i n ( 3 . 1 2 ) and ( 3 . 1 3 ) t o g e t , i n s u c c e s s i o n s
and

P2(x9

y9 n) + P2(x9

y9 n - 1) = P ( x , 2z/, 2n - l ) / 2 2 n " 1

(3.15)

Q2{x9

y9 ri) + Q2(x9

y5 n - 1) = 4 ( ^ 2 + l ) P ( x , 2z/9 2n - l ) ^ 2 * " 1 .

(3.16)

Finally,

and

P(x9 ys m)Q{x9 y5 ri) + P(x9


= P(x9 2y9 m + n)/2m + n-1

y5 n)Q(x9

y9 m)

# ( # , y9 m)Q(x9 y9 ri) + k{x2


= S ( ^ s 2z/9 m + n ) / 2 O T + n - 1

+ l ) P ( x , z/, m)P{x9

(3.17)
y9 ri)
(3.18)

R e v e r t i n g now t o t h e formulas r e l a t i n g e x p o n e n t i a l g e n e r a t i n g f u n c t i o n s t o
P e l l p o l y n o m i a l s , we may e s t a b l i s h , e i t h e r by means of t h e d e f i n i t i o n s o r by
the matrix r e p r e s e n t a t i o n s , the following:
P(x9

y9 n + r)

Q(x9 y9n+r)=
40r

+ l)P(xs

= PrP(x9

y9 n + 1) + Pr_1P(x9

y9

ri)

(3.19)

PrQ(x9
= QrP(x5

y9 n + 1) + Pr_1Q(x9
y9 n + 1) + Qr_1P(x9

y9 ri)
y9

ri)

(3.20)

y9 n + r)

= QrQ(x9

y9 n + 1) + Qr_1Q(x9

S p e c i a l c a s e s of i n t e r e s t occur when v - n i n
Also,
P(x9

y9 n + v)

S ( x , I/, + r)

= h{PrQ(x9
= %{4(^

P ( # , z/, n + r ) P ( # , ys
= (-l)^-^+ipp2e2^ ,

y9 ri) + QrP(x9
+ l)PrP(x9

n - r)

- P (x9

= (-D - Pr+s

ys

n + r + 1) - P(x9
2x

+ 1Pse

(3.19)-(3.21).
y9

ri)},

(3.22)
(3.23)

y9 ri)
y9

ri)
(3.25)

Results (3.24) and (3.25) are the generalized


Lastly, in this section,
y9 n)P(xs

(3.21)

(3.24)

S O c z/, n + r)Q(x9 y9 n - v) - Q (x9


= (-l)"-r4(a;2 + l)Pp22^ .

n S

ri)

y9 ri) + e r (a?, y9 n)},


2

P(x9

y9

Simson

y9n~

s)P(x9

formulas.
y9 n + r + s + 1)

(3.26)

and
G(ff 2/ n)Q{x9 y9 n + r + 1) - ( x , y9 n - s)Q(x9
2
= ( _ 1 } n - s + i 4 ( x 2 + l)P p + s + i P s e ^ .
4.

y9 n + r + s + 1)
(3.27)

SERIES INVOLVING EXPONENTIAL GENERATING FUNCTIONS

Rearranging (2.5) and (2.7), and adding, we find


n

T,P(x9

y9 r)

= {P(x9

y9 n + 1) + P(x9
- P(x9

y9 ri)
y9

1) - P(x9

y9

0)}/2^

(4.1)

0)}/2x.

(4.2)

and
n

Y^Q(X> y> r)

1987]

= iQ(x* y* n + 1) + g(#, y9 ri)


- Q(x9 y9 1) - Q(x9 ys

197

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS

B i n e t forms g i v e us t h e d i f f e r e n c e
P(xs

y9 m{r + I) + k) - QmP(x9

equations,
y9 mr + k)

+ (~l) P(x9

y, m(r - 1) + k) = 0

(4.3)

and
Q(x9 y, m(r + 1) + k) - QmQ(x3 y, mr + k)
+ (~-l)mQ(x9

y9 m(r - 1) + fc) = 0.

(4.4)

Using (4.3) and (4.4), we may derive


n

(4.5)

^2 P(%> y > mr + k)
P(x9

y9 m + k) - (-l)m{P(x9
I - (-1)"

y9 m(n + l) + k) - P(xs

y9 mn + k) - P(x9

y9

k)}

and
YtQ{x9
=

(4.6)

y9 mr + k)

gfa y, m(n+ 1) + k) - Q(x9 y9 m + k) - (~l)m{Q(x5

y9 mn + k) - Q(x9 y9

k)}

Qm - 1 - (-D*
Next, (2.8) and (3.19) used in conjunction with the matrix property
P2 = 2xP + I
yield
D2n

~P(x9

1)1

y,

= (2xP +
_P(x9

y9

I)n

0)J

y9 1)~

[P(x9

(4.7)
[_P(x9 y9 0)_

Equating corresponding elements, we obtain


=

(Z)(2x)rP(x9

P(x9

y,

In)

P(x9

y9

In + 1) =

y9

(4.8)

r)

and
(")(2a?)rP(ar, z/5 r + 1).

r = 0X

(4.9)

'

Similarly,
Q(x9 y9

In)

= (nr)(2x)rQ(x9

y9

(4.10)

r)

and
(x9 y9

In + 1) = P)(2x) r (x, y9 r + 1)
r=0U

(4.11)

Extensions of (4.10) and (4.11) to P(x9 y9 2n + j) and Q{x9 y9 2n + j)


readily follow.
Now let us consider a variation of the type of sequence being summed.
Applying the Simson formula (3.10), simplifying, and summing, we derive

j^PGc,, yys

(-I)11-1
r)P(x9

ys

r + 1)

1
e^^y

/ P(x9 y9 n)
_ P(x9 y9
(P(x9 y9 n + 1)
P(x, y,

0)\
I))
(4.12)

198

[Aug.

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


Similarly,
,fx Q(x9 y9 r)Q(x9

y9 r + 1)

J gQc, y , n)
__ g(xs .y, Q ) |
1
(6(a?, z/, w + 1) g(xs I/, 1 ) / 4(^2 +

1}

J;

5. ORDINARY GENERATING FUNCTIONS OF EXPONENTIAL GENERATING FUNCTIONS


Summing and using (2.5)5
J^P(x9

= (P(x9

y9 r)z*

0) + P(x9

y9

y9 -l)s)V

(5.1)

p= o

where P(xs y 9 -1) is the primitive


Similarly,
y9 r)zr

J^Q(x9

= (Q(x9

of P(#, y 9 0) w.r.t. z/.

function

0) + S(x5 y9 -l)z)V9

y9

(5.2)

p=0

f] (-1) P(x9 y 9 r)zr

= (P(xs y s 0) - P(j?, y 9 -l)s)Vf9

(5.3)

f ^ - l ) 2 ^ * , 2/, r ) * * = ((*, y 9 0) - e(ar, z/, -l)s)Vf8

(5.4)

r=0

and
r=0

More generally,
P(a?, y 9 mv + c)sp - {P(a;, zy,fe)- (~l)mP(xs

y 9 -m + k)z}V(my

(5.5)

ys -m + k)z}SJ{my

(5.6)'

p= 0

and

Y.Q(x9 y9 mr + fe)sr = {Q{x9 y9 k) - (-l)mQ(x9


r= 0

Induction gives

and

- E P ( ^ 9 y9 r)z?
r=0

9n

= ! < * ( n + H p f e , z/, n - r ) s 4 v n
(r=0x x '
j

2/. * ) * r =

I T ^ E ^

n l

iii(

+1

(5.7)

) ^ ^ 2/ " " 2 - ) a 4 v n + 1

(5.8)

w i t h e x t e n s i o n s when r i s r e p l a c e d by r + m.
E q u a t i n g c o e f f i c i e n t s of zv i n ( 5 . 7 ) and ( 5 . 8 ) y i e l d s , i n t u r n *
P(x,

y,n

r)

f (

\ > ( , ,

y,n

- O P * \ _ <}/("'+ *)

(5.9)

and
( * . y,

n + r) = T (

)Q{x,

y,

n - i)P<\_

\/(n

),

(5.10)

since
Kn)
rjn + l _ y\ - p-nin)

zt

t =o

1987]

199

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


where {P }, i = 1, 2, 3, ... is the nth convolution
sequence
mials [4] .
Now, by (2.1) and (2.4), we can demonstrate that
P2(x,

r + 1) - Q2P2(x,

y,

y,

+ Pz(x,

r)

for Pell polyno-

r - 1) = 2(-l)re2xy

y,

. (5.11)

Using this as a difference equation, we obtain


n

P n2 ,(*, y r)

= [P (x,

y,

n + 1) - P2 (x,

z/, 1)

(5.12)

r= 1

- { P 2 ( x , z/, n) - P2(x,

0 ) } + 2 ( 1 - (~l)n)e2xy

y9

]/4x2

and
oo

? 2 ( x , y,

r)zr

= [P2{x,

y,

0) + s{P2(x,

0) - P2(x,

y,

y,

-1)}

(5.13)

r =0

P2(x,

-l)z2

y,

+ 2 s e 2 ^ ] V ( 2 ) / ( l + z)

by ( 1 . 8 ) .
Furthermore,
P2(x, z/, n + 3) - (4x2 + l)P2(x,
2

z/, n + 2)

(5.14)

- (4x + l)P (x, z/, n + 1) + P (x, zy, n) = 0,


% T ^ = (a**""" - 3 ^ e ^ ) / ( a - 3),

t
and

p=o

(5.15)

.2

P yr

oo

-^V
6.

(^

- 2e"^)/(a - 3 ) 2 .

(5.16)

FURTHER APPLICATIONS OF EXPONENTIAL GENERATING FUNCTIONS

Techniques employed for Fibonacci numbers in


Pell polynomials.
To illustrate the method, we show that

r=0yi

[1] are now cultivated for

'

Consider
A = {{e2axy
=

- e2^

{e(2ax+l)y

= (ea2y
oo

)ey}/(a

- e ^ )/(a - 3)

(6.2)

g)

by (1.3)

y"

-Eifrn=0

- 3)

(23^1)y}/(a

ri

by (i.i).

'

However, also,
A =<Z

(2*>"P2/"', , -, y>
Tl
Z S
n!
{2xYP
i!
:

?oh?o
200

by (6.2). and (1.1)

(6.3)

^ " *>

[Aug.

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS

By equating the coefficients of yn in (6.2) and (6.3), w e get


(6s4)

Q il(n - 1)! '

nl

which is equivalent to (6.1).


Observe that (6.2) and (6.3) lead to
dyr

nl

n=o

n = o\i = o

i'-in + r - i !)

where (n)r is the rising factorial.


Hence,
P2(n

r) = "Zo(n

+T
i
i ){2x) Pi,

(6.5)

which is an extension of (6.4).


Turning our attention to
B

= (gCH/ _ e$y)e-^y

/ ( a

3 )

(6.6)

we obtain, in a similar manner,


(-Dn

+1

(".)(-2x)n-%.

Pn = t
i =0

X u

(6.7)

'

Likewise, from
C = (ea2y

- e^)e~y/(a

- 3),

(6.8)

we derive

= (J)(-1)n_fp2f

WPn

<6-9>

i =0

Next, consider
D

= (eumy = (e

20

-2

e^'y)(e

2Bm

^ - e y)/(a

H P

- ^

=E-^T
w=0

am

'

+ e^y)/(a

- 3)

(6.10)

- 3)

^ (1.1).

Now, also,

fl

%?oi^i?o^%?oi?o^^^r-

so

2"?^ = E ( ? ) ^ e m ( - o -

(6

'U)

(6 12)

i=0

If w e investigate
am
- e^)(eamy
E = (e y

- e3?^)/(a - 3 ) 2 S

(6.13)

we are led by the above process, eventually, to

1987]

201

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


2 n e, - 2Qnm = 4 ( x 2 + 1) Z (ly^^n-ry
r=0
Similarly,

2Qm

+2Qnm = t(nv)QmrQm,n-P)-

<6-14>

(6-15)

r=0

Suppose now that


F = {{ea"my

' E

- e^my)ey}/(a

^1

(6.16)

by (1-1) a ^ (1.2).

ni

w=0

- 6)

But, also,
P yn'

F=ii:^T-KJ:^}
n = 0 n ' J (w = 0 '

by (6.16) and (1.1)

(6.17)

Consequently,

^=0

Differentiating r times partially w.r.t. y the two expressions (6.16) and


(6.17) for P , as w e did earlier for A [cf. (6.5)], w e obtain the extension of
(6.18), namely,
i = 0

Finally, consider
G = {ea"v

- es"y)/(a

- 3)

(6.20)

= { e p - ^ ( e a P " y - e 6 P " y )}/(a - g)

v1T

~'L "^- \u*

Also,
oo P yn

G = J]

by (6.20) and (1.1).

(6.21)

n =0

202

[Aug.

EXPONENTIAL GENERATING FUNCTIONS FOR PELL POLYNOMIALS


Then
p

= y

(n\pi

.pn~i

= y

ln\pn-ip

pi

(6.22)

whence
8 G
dyr

and

m{n+r)

y
n=o

n + r(n

m(:n + P ) "

/<

) m m-

r m m-

(6.23)

i\ (n + r - i ) !

ft = 0 ( = 0

n + p \ rp ir p f t + p - i pr

i-nn+r-i. P.
+ 1) PJP

(6.24)

The presentation in this article of the properties of the exponential generating functions of Pell and Pell-Lucas polynomials suffices to give us something of their mathematical flavor.
Important special cases of the Pell polynomials and Pell-Lucas polynomials
are noted in [3] and may5 for variety and visual convenience, be tabulated as:
Pn

Qn

X = 1

Pell numbers

Pell-Lucas numbers

x = h

Fibonacci numbers

Lucas numbers

x -+ %x Fibonacci polynomials

Lucas polynomials

Results given in this paper for exponential generating functions, and in


[6] for ordinary generating functions, of Pn and Qn may clearly be specialized
to corresponding results for the tabulated mathematical entities.
REFERENCES
C. A. Church & M. Bicknell. "Exponential Generating Functions for Fibonacci
Identities." The Fibonacci
Quarterly
11, no. 3 (1973):275-81.
H. W. Gould. "Generating Function for the Products of Powers of Fibonacci
Numbers." The Fibonacci
Quarterly
1 9 no. 1 (1963):1-16.
A. F. Horadam & Bro. J..M. Mahon. "Pell and Pell-Lucas Polynomials." The
Fibonacci
Quarterly
23s no. 1 (1985):7-20.
Bro. J. M. Mahon. "Pell Polynomials." M.A., (Hons.) Thesis, University of
New England, 1984.
Bro. J. M. Mahon & A. F. Horadam. "Matrix and Other Summation Techniques
for Pell Polynomials." The Fibonacci
Quarterly
249 no. 4 (1986):290-309.
Bro. J. M. Mahon & A. F. Horadam. "Ordinary Generating Functions for Pell
Polynomials." The Fibonacci
Quarterly
259 no. 1 (1987):45-56.
J. E. Walton. "Properties of Second Order Recurrence Relations." M.Sc.
Thesis, University of New England, 1968.
00f

1987]

203

You might also like