Professional Documents
Culture Documents
Polynomial Coefficients and Distribution of The Sum of Discrete Uniform Variables
Polynomial Coefficients and Distribution of The Sum of Discrete Uniform Variables
Abstract
f (x) = (1 + x + x2 + . . . + xk )n
in which coefficients are called the polynomial coefficients (Comtet, 1974). These coef-
ficients generalize the binomial coefficients. We give alternative proofs for André (1875)
results on the distribution of the sum of discrete uniform variables. The result is also
given in terms of hypergeometric polynomials. Some properties and identities are also
obtained.
1
Proof. By binomial expansion, we have
n !
k n
X n
(1 + x + . . . + x ) = (x + x2 + . . . + xk )z
z=0
z
n !
X n z
= x (1 + x + . . . + xk−1 )z
z=0
z
n ! z(k−1) !
X n z X z p
= x x
z=0
z p=0
pk
Xn z(k−1)
X n! z !
= x p+z
z=0 p=0
z p k
q(k − 1)
Let q = p + z. Then 0 ≤ p ≤ z(k − 1) and p ≤ , so that
k
nk ⌊q(k−1)/k⌋ ! !
X X n q− p
(1 + x + x2 + . . . + xk )n = xq (1.3)
q=0 p=0
q− p p k
By independency,
k n
n X eitp
φY (t) = φX (t) = , ∀t ∈ R (2.3)
k + 1
p=0
In this section we obtain the distribution of Y in three different forms. Earlier attempts on
distribution of Y, as a convolution, are given in [2] and [4]. Our results appear to be in a
better and explicit forms as compared to that given by André (1875).
Theorem 2.1. The distribution of Y is given by
!
1 n
P(Y = y) = , y ∈ {0, 1, . . . , nk} (2.4)
(k + 1)n y k+1
2
Proof. Applying the inversion formula of the characteristic function for discrete distribu-
tions to (2.3), based on Fourier series, we have
Z π
1
P(Y = y) = e−ity φY (t)dt
2π −π
Z π k n
1 X eitp
= e−ity dt (2.5)
2π −π p=0
k + 1
Z 2π k n
ip(t−π)
1 X e
e−iy(t−π)
= dt
2π 0 p=0
k + 1
(−1)y
!
y n y!
= n
(−1)
y!(k + 1) y k+1 (y − y)!
!
1 n
= n
(k + 1) y k+1
3
Proof. Starting from (2.7), we have
k n
(−1)y dy X
P(Y = y) = lim (−1) p w p
y!(k + 1)n w→0 dwy p=0
y
!n
(−1) y
d 1 + (−1)k+2 wk+1
= lim
y!(k + 1)n w→0 dwy 1+w
n
(−1)y dy X n
! p
= lim (−1)k+2 wk+1 ×
y!(k + 1)n w→0 dwy p=0 p
∞
X n + z − 1!
z
× (−w)
z=0
z
∞ n
(−1)y dy X X n n + z − 1
! !
p(k+2)+z p(k+1)+z
= lim (−1) w
y!(k + 1)n w→0 dwy z=0 p=0 p z
(−1)y X X n ! n + z − 1!
= lim ×
y!(k + 1)n w→0 z p p z
(p(k + 1) + z)!
× (−1) p(k+2)+z w p(k+1)+z−y
(p(k + 1) + z − y)!
⌊y/(k+1)⌋ !
(−1)y X n n + y − p(k + 1) − 1
!
p+y
= y!(−1) ,
y!(k + 1)n p y − p(k + 1)
p=0
4
Proof: From (2.8), we get
⌊y/(k+1)⌋
p
n X Γ(n + y − p(k + 1))(−1)
P(Y = y) =
(k + 1)n p=0 Γ(p + 1)Γ(n − p + 1)Γ(y − p(k + 1) + 1)
k
Y −y + a
⌊y/(k+1)⌋ (−n) p Γ p +
(−1) n−1 X a=0
k + 1
=
(n − 1)!(k + 1)n p=0 k !
Y −y − n + 1 + a
p!(k + 1)−n+1 Γ p+
a=0
k + 1
k k
−y + a
Y Y −y + a
Γ ⌊y/(k+1)⌋ (−n) p
(−1)n−1 a=0
k+1 X a=0
k+1 p
=
(n − 1)!(k + 1) Y k k
! !
−y − n + 1 + a p=0 Y −y − n + 1 + a
Γ p!
a=0
k+1 a=0
k+1 p
Yk −y + a
Γ
(−1)n−1 a=0
k+1
= !×
(n − 1)!(k + 1) Y
k
−y − n + 1 + a
Γ
a=0
k+1
k k
Y −y + a Y −y + a
(−n) p (−n) p
X ∞
a=0
k+1 p X ∞
a=0
k+1 p
× −
k k
! !
p=0 p!
Y −y − n + 1 + a p=⌊y/(k+1)⌋+1
Y −y − n + 1 + a
p!
a=0
k+1 p a=0
k+1 p
Yk −y + a
Γ
(−1)n−1 a=0
k+1
= !×
(n − 1)!(k + 1) Y
k
−y − n + 1 + a
Γ
a=0
k+1
k
Y −y + a
(−n) p
X ∞
a=0
k+1 p
×
k !
p=0 p!
Y −y − n + 1 + a
a=0
k+1 p
k
−y + a
Y
(−n) q+⌊y/(k+1)⌋+1
X∞
a=0
k + 1 q+⌊y/(k+1)⌋+1
− (2.10)
k !
q=0
Y −y − n + 1 + a
(q + ⌊y/(k + 1)⌋ + 1)!
a=0
k + 1 q+⌊y/(k+1)⌋+1
5
Using multiplication for Gamma function [5, page11]
n−1 !
nz+b− 12 1−n
Y b+k
Γ(nz + b) = n (2π) 2 Γ z+ , n∈N (2.11)
k=0
n
(2.10) yields (2.9). It may be observed that (2.12) is a terminating series (polynomial)
when any ai is a negative integer or zero.
3. Special Cases. It is interesting to obtain the distribution of X1 + X2 by various methods.
We first obtain the distribution of X1 + X2 in a different manner, and then obtain it as a
special case of Theorems 2.1, 2.2 and 2.3 respectively.
Lemma 3.1. We have
k − |k − y| + 1
P(X1 + X2 = y) = , y ∈ {0, 1, . . . , 2k} (3.1)
(k + 1)2
Proof.
X
P(X1 + X2 = y) = P(X1 + X2 = y, X1 = z)
z
X
= P(X2 = y − z, X1 = z)
z
X
= P(X2 = y − z)P(X1 = z)
z
y
X 1 y+1
= , 0≤y≤k
2 (k + 1)2
z=0 (k + 1)
= k
X 1 2k − y + 1
= , k + 1 ≤ y ≤ 2k
2 (k + 1)2
z=y−k (k + 1)
k − |k − y| + 1
=
(k + 1)2
The result (3.1) can be obtained from the convolution result given in [2] or [4] after
some simplifications. It can be obtained from Theorem 2.1 as a special case. From (2.5),
6
we have
k 2
Z 2π X eipt (−1) p
1
P(X1 + X2 = y) = e−ity (−1)y dt
2π 0 p=0
k + 1
!
1 2
=
(k + 1)2 y k+1
k Z
k
1 X 2π −iyt e iqt
(−1)q X e ipt
(−1) p
e (−1)y
= dt
2π q=0 0 k + 1 p=0 k + 1
k Z 2π
k
1 X X eipt (−1) p
−i(y−q)t y−q
= e (−1) dt
2π(k + 1)2 q=0 0 p=0
k + 1
k !
1 X 1
=
(k + 1)2 q=0 y − q k+1
y
X 1 !
, 0≤y≤k
q=0 y − q
1
= k
(k + 1)2
!
X 1
, k < y ≤ 2k
q=y−k y − k k+1
y
X
(1), 0 ≤ y ≤ k
1
q=0
= k
(k + 1)2
X
(1), k < y ≤ 2k
q=y−k
1 y + 1,
0≤y≤k
= 2
(k + 1) 2k − y + 1, k < y ≤ 2k
k − |k − y| + 1
=
(k + 1)2
The Lemma 3.1. can be verified from Theorem 2.2 also. From (2.6), we have
⌊y/(k+1)⌋ !
(−1)y X 2 2 + y − p(k + 1) − 1
!
p+y
P(X1 + X2 = y) = y!(−1)
y!(k + 1)2 p=0 p y − p(k + 1)
⌊y/(k+1)⌋ !
(−1)y X 2
p+y
= (y − p(k + 1) + 1)y!(−1)
y!(k + 1)2 p=0 p
We have that
y
0, 0 ≤ y ≤ k
=
k+1 1, k < y ≤ 2k
7
So that
(−1)y 2
!
(y + 1)y!(−1)y ,
0≤y≤k
y!(k + 1)2 0!
P(X1 + X2 = y) = ! !
1 2 2
(k + 1)2 0 (y + 1) − 1 (y − (k + 1) + 1) , k < y ≤ 2k
y+1
, 0≤y≤k
(k + 1)2
= 2k − y + 1
, k < y ≤ 2k
(k + 1)2
k − |k − y| + 1
=
(k + 1)2
The Lemma 3.1 can also be obtained from Theorem 2.3 as follows. From (2.9), we
have
!
y+1 −y + k −y − 1
P(Y = y) = 2 F 1 −2, ; ;1
(k + 1)2 k+1 k+1
(−2)⌊ y ⌋+1 y
− j y k k+1 y − (k + 1) 1 + +1 ×
Γ k+1 + 2 (k + 1)2 k+1
y −y + k y
× 3 F2 1, −2 + + 1, + + 1;
k+1 k+1 k+1
y !
−y − 1 y
+ 2, + + 1; 1
k+1 k+1 k+1
For 0 ≤ y ≤ k,
!
y+1 −y + k −y − 1
P(Y = y) = 2 F 1 −2, ; ;1
(k + 1)2 k+1 k+1
!
y−k 2k − y + 1 k−y
+ 3 F 2 1, −1, ; 2, ;1
(k + 1)2 k+1 k+1
y+1
=
(k + 1)2
For k < y ≤ 2k,
!
y+1 −y + k −y − 1
P(Y = y) = 2 F 1 −2, ; ;1
(k + 1)2 k+1 k+1
!
(−2)2 −y + k −y − 1
− (y − 2(k + 1) + 1)3 F2 1, 0, + 2; 3. + 2; 1
Γ3(k + 1)2 k+1 k+1
Thus,
k − |k − y| + 1
P(X1 + X2 = y) =
(k + 1)2
8
4. Further properties and identities of PC. In this section we give two more properties
of PC and two identities.
Property 4.1. We have,
! k !
n X n−1
= (4.1)
q k+1 z=0
q − z k+1
Thus,
! Z π k n
n 1 X
= e−itq eitp dt (4.2)
q k+1 2π −π p=0
Z π k
k n−1
1 X X
e−itq eitr eitp dt
=
2π −π r=0 p=0
k Z π k
n−1
X 1 X
= e−it(q−r) eitp dt
r=0
2π −π p=0
k
X n−1 !
=
r=0
q − r k+1
9
Property 4.3. We have
nk
n(k + 1)n k
!
X n
q= . (4.4)
q=0
q k+1 2
E(Y) = nE(X)
k
n X
= x
k + 1 x=0
nk
= (4.5)
2
Also
d
E(Y) = i−1 lim φY (t)
t→0 dt
k n
d X eitp
= i−1 lim
t→0 dt k + 1
p=0
nk !
d X n
= i−1 lim eitq
t→0 dt q k+1
q=0
nk !
1 X n
=
q (4.6)
(k + 1)n q=0 q k+1
The expressions (4.5) and (4.6) result into the identity (4.4).
Property 4.4. We have
nk
n(k + 1)n k
!
X n
q2 = (k(3n + 1) + 2) (4.7)
q=0
q k+1 12
Proof. We have
Var(Y) = nVar(X)
n
= k(k + 2) (4.8)
12
Thus,
10
Also
d2
E(Y 2 ) = i−2 lim φY (t)
t→0 dt2
k n
d2 X eitp
= − lim 2
t→0 dt k + 1
p=0
nk !
2
d X n
= −(k + 1)−n lim 2 eitq
t→0 dt q k+1
q=0
nk !
1 X n
2
= q (4.10)
(k + 1)n q=0 q k+1
1
1 1 1 1
1 2 3 4 3 2 1
1 3 6 10 12 12 10 6 3 1
1 4 10 20 31 40 44 40 31 20 10 4 1
1 5 15 35 65 101 135 155 135 101 65 35 15 5 1
Table 5.1
11
For q = 0,
!
0
D1(k+1) = = 1 = F1(k+1) (5.3)
0 k+1
and for q = 1,
! !
1 0
D2(k+1) = + = 1 + 0 = 1 = F2(k+1) (5.4)
0 k+1 1 k+1
Assume
!
X m−1− p
Fm(k+1) = p=0 m−1
, m≤n (5.5)
p k+1
Property 5.3. The sum of the first m + 1 rows are repunits in base k + 1 [8]. A repunit is
a number whose digits are copies of digit 1. In base b, we have
bn − 1
R(b)
n = (5.7)
b−1
With b = 2, we obtain Mersenne numbers.
Proof. By using (5.6), we get
m
X (k + 1)m+1 − 1 (k+1)
(k + 1)q = = Rm+1 (5.8)
q=0
k
12
References
[1] D. André, Mmoire sur les combinaisons rgulires et leurs applications, Annales Sci-
entifiques de l’. N. S., 2, tome 5 (1876), p. 155-198.
[5] Y. L. Luke, The Special Functions and Their Approximations, Vol. I, Academic
Press, New York, 1969.
[6] M. D. Springer, The Algebra of Random Variables, John Wiley & Sons, 1979.
13