Maths

NOTE ON SOME GENERATING FUNCTIONS
L. CARLITZ*
Duke University, Durham, Worth Carolina 27706
1. In a recent paper in this Quarterly, Bruckman [2] defined a sequence of positive integers Bk by means of
(1-xr1(1+xr* = Y*Bk~i;
k
(1.1)
k=0
2 *k!
This is equivalent to the recurrence

(1.2)
Bk = Bk-f + (2k - 1)(2k-2}Bk-2
(k > 2),
B0 = B1 = 1
Making use of (1.2) he showed that
.u.
s f .*> * g
0
k=0
and
(1-x2f1
arctanx =
B2k ^
k=0
Bateman [1] has discussed the polynomialg n (y,z) defined by
-4)
(1+x)V+z{1-xFY
(1.5)
= J2
xngn(y,z);
n=0
see also [ 3 ] . On the other hand the Jacobi polynomial [6, Ch. 16]
d.6)
^^-E(n)(^")(^- ? )V-f 1 )'"

k=0
satisfies
f ; ptn'*-n)(x)zn = ( / +x-^z)a (/ +^-z
d.7)
n=0
and in particular, f o r * = 0,
X Pt~n'^n) (o)zn = (i + y2z)a(i-y2zf
(1.8)
n=0
It follows from (1.1) and (1.8) that
(1.9)
-1 Bk = 22kPt*-k>-'-k>(0)
= (-Vk22kpt1-k'-1/2-k)(Ol
k!
We shall show that both (1.3) and (1.4) can be generalized considerably. We also obtain the following congruence
for;
*Supported in part by NSF Grant No. GP-17031.
129
130
NOTE ON SOME GE(\!ERATING FUNCTIONS
[APR.
r
(1.10)
(-V ( s ) Bn+smB(r-s)m - 0 (mod r! mr )>

s=0
where m and r are arbitrary positive integers.
It would be of interest to find a combinatorial interpretation of B^ .
2. The writer [4] has obtained the following bilinear generating function:
(2 1)
Z rr(x~1>n(y
i)nwnp(na-n'-a-y-n}
( j ^ | ) ptn^7'n)
(*^|)
r?=a
where as usual
F{z,b;c;z)
= ] jffcT
n=0
and
"
"
a(a + 1)-(a+n
- 1),
(a)0 = 1 .
In particular, f o r * = / = - / and 7 = - a - (3, Eq. (2.1) reduces to

00
(2.2)
X ; / S ^ j - 4nwnPtnM~n>(0)Ptn'a'n>(0)
=0 ' " a - ^ "
= a + wF+H
- a , - 0 ; - a - 0; - * * _ " | .
2
r/+^ j
It is convenient to replace a, 0 by - a , (3, so that (2.2) becomes

(2 3)
n f t " ^
= 0 ' a + <""
- f / + ^ f [ n ( i ; o + / l ; - ^ 2l
/7 + wJ J
Specializing further, we take (3= a+ /i, so that

oo
(2.4)
7-^
4nwnp(-a-n,-*-y2-n)(Q)pM^-a-n)(Q)
V2
l
= (1+wr2a
F\a/a+y2|;2a+y2,^^\
.
a~*F
a,a+%;2a+%,
2
]
L
(1
+
w)
]
(1
+
wf
1
Next in formula (2) of [6, p. 66],
V2a,1/2a+
1
take a = 2a,b= /2.
/2;a-b + 1; ^
We get
(2.5)
"\ = (1 +z)aF[a,b;a
(1+z)2 J
a,a + %;2a+%;
2
+ z; J
Hence (2.4) becomes
-b + 1;z]
(1+zrFf2a,,A;2a+,A;zJ.
*' (2a + %)r,

n=0
Since
Pt'0>M
(~1)nPlf'a)(-x),
(2.6) may be written in the form

CO
27
4 wn
L
"
i P!!-a-n'-a-'A'n)
(0)\2
(2aTW
n=0
In particular, for a = %, it follows from (2.7) and (1.9) that
<->
* (1- wr'AF[2a,
CO
^ti'<'-r*Fn.*;3/2;^J.
/7-0
%;2a+ X;
-w].
1975]
MOTE ON SOME GENERATING FUNCTIONS
131
Replacing w by z , this becomes

(2.8)
JttuBl
= z<1-*r*F[1.%;3/2;-z2] .
n=0
Since
zF(1,V,;3/2;-z2] = f )
(-V
^f-z2n+1
rt=0
"
it is evident that (2.8) is the same as (1.4).

3. In (2.1)takex = - 7 , y = 0, j= -a-/}.
= f ] M/1 ^
= arctanz
A7^0
Since, by (1.6),
p(V-n,*-n)(_v
ja
it is clear that (2.1) reduces to
*"*
n=0
Replacing a,j3 by - a , ]3f this becomes

J2 (_Vn Mn2nwnPta-n'-P-n)(0)
*'
(a + (3)n
(3.1)
= (1 + wraF\
a, P;a + P; j7 ^ - 1
^ J
/7=0
In particular, for /3= 14 we get

oo
3 2
'->
7 2nznP(na-n<-y2-n)(0)
= (1 - z)'aF
a,
/2;a+1/2; -2z
1 -z
/7=0
Fora= 1, Eq. (3.2) becomes
1L ** = (1-zr1F\1,%;3/2;-
(3.3)
^02n(3/2)n
^~
' - *
This is not the same as (1.3).

The right-hand side of (3.2) is equal to
(a)r(y2)r ,
S^
, j r v ^ (a + r)s
s!
r!(a+Y ) *>T
~" *-*
'-*"'-"--E-^&
r=0
2 r
r=0
5=0
n=0
r=0
Hence (3.2) implies

oo
oo
2"zn
p(-OL-n,-%-n)
2-r J^T
n=0
"
/n\
{U}
/7
_ V * , f i \ " ^ / n\r
L*
n=0
n
l^
{ Z)
r=0
n
(%)r
r!(n-r)!(a+1/2)r
r!(a+1/2)r
r=0
so that
(3.4)
hJWn
( }
n=0
r=0
For a= 1, Eq. (3.4) reduces to (1.3)

4. Put
(4.1)
n=0
r!(a+y2)r
^
n=r
(n-r)l
132
NOTE ON SOIVIE GENERATING FUNCTIONS
[ A PR.
Then
oo
5 2 cm(a,$)cn(a,$)xmyn
m,n=0
= (1-x)a(1
-y)a(1
= (1 +xy-x-y)a(1
+xf(1+yf
+xy +x + yf
00
E *^EUr^Er* r y
QL+$-k
k=*0
s=0 '
r=0
r *v E ; rT* Wa^
m,n=0
s+t=m
k-s+t=n
It follows that
mm (m,n)
(4.2)
cm(aMn(a.V
( "^l'
' ) (a + " - ? ' " " + 2 t )
cm+n^(M
The proof follows Kaluza [ 6 ] ; see also [ 3 ] .

Comparing (4.1) with (1.1), we have
(4.3)
2k.k!ck(-1,-1/2).
Bk =
Thus (4.2) implies

m/n(m,n)
(4.4)
BmBn
f - ^ ' ( 7 ) ( ? )f/ n
(2m+2n-2t-2j+1)Bm+n-2t
For /77 = 1, Eq. (4.4) reduces to (1.2). It is not difficult to prove (4.4) by induction.
The writer has proved the following result [ 5 ] .
Let f(n), gin) denote polynomials In n with integral coefficients. Define un by means of
(4.5)
where
(4.6)
un+1 = f(n)un+g(n)un..i
u0 = I
In > 1),
u7 = f(Q),
g(0) = 0.
Then un satisfies the following congruence:

A2run
(4.7)
= A2r"1un
- 0
(modmr),
for all m > 1, n > 0, r> 1, where

^
U n
12 (-1>r~S\
s=0
s )un+smU(r-s)m
Comparing (4.5) with

Bn+l = Bn+2n(2n
+ l)Bn_1
it is clear that (4.6) holds. We have therefore

r
(4.8)
E M
s=0
" \ s )Bn+smB(r-s)m
However a better result can be obtained. By (4.4) we have
- 0 (mod m[(r+1}/2]
).
1975]
MOTE ON SOIVIE GENERATING FUNCTIONS
L (-U (;) Bn+smB(r_s)m = i-m(;

s=0
'
s=0
(2n + 2rm - 2t - 2j + 1hBn+rm.2t
133
) t-w ( n +tm)lfr-;lm W. n'
= Y, (- V* 2-. Bn+m.2t
/\
j-0
U (2n + 2rm - 2t - 2j + 1)
i=0
where
f(s) = (n+sm-t+
1)t((r-s)m
- t + 1)t .
Clearly
f(s) = ao + aism + + a2t(sm)
where the a-, are integers. Then

,
r
(
i r S
2t
( s)
f(s) =
s=0
Z ^2''ArO''
- 0
(modr!mr).
i=r
Since
?f f - 7
~
t!
n (2n+2rm-2t-2j+1)
j=0
is integral, it follows at once that

r
(-1TS ( ) Bn+smB(rs)m
^ 0
(modr!mr).
s=0
REFERENCES
1. H. Bateman, "The Polynomial of Mittag-Leffler," Proc. Nat. Acad. Sci., USA, 26 (1946), pp. 491-496.
2. P.S. Bruckman, "An Interesting Sequence of Numbers Derived from Various Generating Functions," The Fibonacci Quarterly, Vol. 10, No. 2 (April 1972), pp. 169-181.
3. L Carlitz, " A Special Functional Equation," Riv. Mat, Univ. Parma, 7 (1956), pp. 211-233.
4. L Carlitz, " A Bilinear Generating Function for the Jacobi Polynomials," Bolletino Unione Matematica Itaiiana
(3), 18 (1963), pp. 87-89.
5. L Carlitz, "Congruence Properties of the Polynomials of Hermite, Laguerre and Legendre," Math. Zeitschrift,
59 (1954), pp. 474-483.
6. Th. Kaluza, "Elementarer Beweis einer Vermutung von K. Friedrichs," Mathematische Zeitschrift, 37 (1933),
pp. 689-697.
7. E.D. Rainville, Special Functions, Macmillan, New York, 1960.
*******

Maths

Uploaded by

Copyright:

Available Formats

Maths

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Maths

Uploaded by

Copyright:

Available Formats

NOTE ON SOME GENERATING FUNCTIONS

This is equivalent to the recurrence

Bk = Bk-f + (2k - 1)(2k-2}Bk-2

Making use of (1.2) he showed that

^^-E(n)(^")(^- ? )V-f 1 )'"

f ; ptn'*-n)(x)zn = ( / +x-^z)a (/ +^-z

X Pt~n'^n) (o)zn = (i + y2z)a(i-y2zf

It follows from (1.1) and (1.8) that

NOTE ON SOME GE(\!ERATING FUNCTIONS

(-V ( s ) Bn+smB(r-s)m - 0 (mod r! mr )>

In particular, f o r * = / = - / and 7 = - a - (3, Eq. (2.1) reduces to

It is convenient to replace a, 0 by - a , (3, so that (2.2) becomes

Specializing further, we take (3= a+ /i, so that

take a = 2a,b= /2.

Hence (2.4) becomes

*' (2a + %)r,

(2.6) may be written in the form

MOTE ON SOME GENERATING FUNCTIONS

Replacing w by z , this becomes

it is evident that (2.8) is the same as (1.4).

it is clear that (2.1) reduces to

Replacing a,j3 by - a , ]3f this becomes

In particular, for /3= 14 we get

Fora= 1, Eq. (3.2) becomes

This is not the same as (1.3).

Hence (3.2) implies

For a= 1, Eq. (3.4) reduces to (1.3)

NOTE ON SOIVIE GENERATING FUNCTIONS

' ) (a + " - ? ' " " + 2 t )

The proof follows Kaluza [ 6 ] ; see also [ 3 ] .

Thus (4.2) implies

Then un satisfies the following congruence:

for all m > 1, n > 0, r> 1, where

Comparing (4.5) with

it is clear that (4.6) holds. We have therefore

However a better result can be obtained. By (4.4) we have

MOTE ON SOIVIE GENERATING FUNCTIONS

L (-U (;) Bn+smB(r_s)m = i-m(;

(2n + 2rm - 2t - 2j + 1hBn+rm.2t

) t-w ( n +tm)lfr-;lm W. n'

where the a-, are integers. Then

is integral, it follows at once that

You might also like