Information Technology Reference
In-Depth Information
Then, there are
k
1
!
k
2
!
...k
q
! ways to arrange our ordered blocks so that we have
not changed the product. Thus,
q
E
f
j
(
x
)
k
j
k
j
!
E
h
k
(
x
)=
g
(
k
,
)
j
=1
and summing over all
k
gives the desired result.
References
1. Apostol, T.M.: Calculus, 2nd edn., vol. 2. John Wiley and sons, Chichester (1969)
2. Copson, E.T.: An Introduction to the Theory of Functions of a Complex Variable.
The Clarendon Press, Oxford (1935)
3. Knuth, D.E.: The Art of Computer Programming, 2nd edn. Fundamental Algo-
rithms, vol. 1. Addison-Wesley, Reading (1973)
4. Sweatlock, S.L.: Caltech Ph.D. thesis (2008)
5. Stanley, R.P.: Enumerative Combinatorics, vol. 1
6. Stanley, R.P.: Enumerative Combinatorics, vol. 2
