1. Introduction
Griffiths [
1] and Diaconis and Griffiths [
2] construct multivariate Krawtchouk polynomials orthogonal on the multinomial distribution and study their properties. Recent representations and derivations of the orthogonality of these polynomials are in [
3,
4,
5,
6].
The authors emphasise different approaches to the multivariate orthogonal polynomials. The approach of Diaconis and Griffiths [
2] is probabilistic and directed to Markov chain applications; the approach of Iliev [
5] is via Lie groups; and the physics approach of Genest 
et al. [
3] is as matrix elements of group representations on oscillator states. Xu [
7] studies discrete multivariate orthogonal polynomials, which have a triangular construction of products of one-dimensional orthogonal polynomials. They are particular cases of the polynomials in this paper; see Diaconis and Griffiths [
2]. These polynomials extend the Krawtchouk polynomials on the binomial distribution to a general class of multi-dimensional orthogonal polynomials on the multinomial distribution. They appear naturally in composition Markov chains as eigenfunctions in a diagonal expansion of the transition functions. There are many interesting examples of these Markov chains in Zhou and Lange [
8]. Binomial and multinomial random variables can be constructed as a sum of independent and identically distributed random variables, which are indicator functions of the events that occur on each of 
N trials. The Krawtchouk and multivariate Krawtchouk polynomials are symmetric functions of orthogonal functions sets on each of the trials. The simplest case is the Krawtchouk polynomials where the representation is explained in 
Section 2. In the multivariate Krawtchouk polynomials, there is not a unique orthogonal function set on trials with multiple outcomes greater than two, so the polynomials depend on which orthogonal function set is taken for a basis on the trials.
A well-known spectral expansion by Karlin and McGregor [
9,
10,
11] for the transition functions 
 of a birth and death process with rates 
, 
 is that:
	  where 
 are orthogonal polynomials on the spectral measure 
ψ, which is a probability measure, and:
A number of classical birth and death processes have a spectral expansion where the orthogonal polynomials are constructed from the Meixner class. This class has a generating function of the form:
	  where 
 is a power series in 
t with 
 and 
 is a power series with 
 and 
. Meixner [
12] characterizes the class of weight functions and orthogonal polynomials with the generating function Equation (
3). They include the Krawtchouk polynomials, Poisson–Charlier polynomials, scaled Meixner polynomials and Laguerre polynomials (the Meixner orthogonal polynomials are a specific set belonging to the Meixner class with a name in common). A general reference to these orthogonal polynomials is Ismail [
13].
In this paper, the spectral expansion is extended to composition birth and death processes, where there are 
N independent and identically distributed birth and death processes operating and 
 is such that the 
i-th element 
 counts the number of processes in state 
i at time 
t. In the analogue of Equation (
1), the spectral polynomials are the dual multivariate Krawtchouk polynomials. The dual polynomial system is therefore very important, and attention is paid to describing it.
There are extensions of the multivariate Krawtchouk polynomials to multivariate orthogonal polynomials on the multivariate Meixner distribution and multivariate product Poisson distribution, where they occur as eigenfunctions of multi-type birth and death processes [
14].
This paper defines the multivariate Krawtchouk polynomials, summarizes their properties, then considers how they are found in spectral expansions of composition birth and death processes. It is partly a review of these polynomials and is self-contained. For a fuller treatment, see Diaconis and Griffiths [
15]. The polynomials are naturally defined by a generating function, and so, generating function techniques are used extensively in the paper. Probabilistic notation is used, particularly the expectation operator 
, which is a linear operator acting on functions of random variables, which take discrete values in this paper. If 
 are random variables, then:
Often, orthogonal polynomials are regarded as random variables. For example, 
 are the one-dimensional Krawtchouk polynomials as random variables and:
	  where 
. A convention of using capital letters for random variables and lower case for values that they take is used, except when the random variables are denoted by Greek letters, when they have to be considered in context.
Section 2, Theorem 1, shows how the Krawtchouk polynomials can be expressed as elementary symmetric functions of 
N Bernoulli trials, centred at their mean 
p. The Meixner orthogonal polynomials on the geometric distribution are also expressed as functions of an infinity of centred Bernoulli trials in Theorem 2. There is some, but not total symmetry in this expression. Krawtchouk polynomials occur naturally as eigenfunctions in Ehrenfest urn processes, and the eigenfunction expansion of their transition functions is explained in 
Section 2.3. 
Section 3 introduces the multivariate Krawtchouk polynomials, explaining how they are constructed in a symmetric way from a product set of orthogonal functions on 
N independent multinomial trials. The dual orthogonal system is described and a scaling found, so that they are multivariate Krawtchouk polynomials on a different multinomial distribution in Theorem 3. The polynomial structure of the multivariate Krawtchouk polynomials is described in Theorem 4 and the structure in the dual system in Theorem 5. Recurrence relationships are found for the system in Theorem 6 and for the dual system in Theorem 7. The dual recurrence relationship is used to identify the polynomials as eigenfunctions in a 
d-type Ehrenfest urn in Theorem 8. In 
Section 3.2, a new extension is made to multivariate Krawtchouk polynomials where there are an infinite number of possibilities in each multinomial trial. These polynomials occur naturally as eigenfunctions in composition birth and death processes in a Karlin and McGregor spectral expansion in Theorem 9. Theorem 10 considers the polynomial structure of the dual polynomials in the spectral expansion. Theorem 11 gives an interesting identity for these spectral polynomials in composition birth and death processes when the spectral polynomials in the individual processes belong to the Meixner class.
   3. Multivariate Krawtchouk Polynomials
The multivariate Krawtchouk polynomials with elementary basis 
u were first constructed by Griffiths [
1]. A recent introduction to them is Diaconis and Griffiths [
2]. They play an important role in the spectral expansion of transition functions of composition Markov processes. Zhou and Lange [
8], Khare and Zhou [
16] have many interesting examples of such Markov processes. Later in this paper, we consider the particular composition processes where there are 
N particles independently performing birth and death processes.
The multivariate Krawtchouk polynomials are orthogonal on the multinomial distribution:
	  with 
 a probability distribution. Let 
 be independent and identically distributed random variables specifying outcomes on the 
N trials, such that:
Let 
 be an orthogonal set of functions on 
 with 
 satisfying:
This notation for the orthogonal set of functions follows Lancaster [
17]. There is an equivalence that:
	  are elements of a 
 orthogonal matrix 
H. In this paper, 
 are usually orthonormal functions with 
, 
, unless stated otherwise. The one-dimensional Krawtchouk polynomials are constructed from a symmetrized product set of orthogonal functions 
, and the construction of the multivariate polynomials follows a similar, but more complicated procedure. Instead of having two unique elements in each orthogonal function set, there is a choice of orthogonal basis, and the construction is from the product set 
. The orthogonality Equation (
25) is equivalent to:
	  for 
. Define a collection of orthogonal polynomials 
 with 
 and 
 on the multinomial distribution as symmetrized elements from the product set, such that the sum is over products 
 with 
 for 
. 
 is the coefficient of 
 in the generating function:
In the one-dimensional case 
, 
, orthogonal on 
, so the generating function is:
	  which is, of course, the generating function of the Krawtchouk polynomials. 
 are respectively the number of zero and one values in the 
N trials. It is straightforward to show, by using the generating function Equation (28), that:
	  where 
, with 
. Instead of indexing the polynomials by 
, they could be indexed by 
. This notation is sometimes convenient to use in the paper. The dual orthogonality relationship is, immediately from Equation (
30),
      
Expanding the generating function Equation (28) shows that:
	  
	  where · indicates summation over an index and 
 for non-negative integers 
b. The dual generating function is:
Expanding the generating function:
The two generating function Equations (28) and (33) are similar, and there is a form of self-duality for the polynomials. Let:
Then, because of Equation (
25):
The right side of Equation (
33) is equal to:
	  which, apart from the different indexing and non-constant function 
, generates multivariate Krawtchouk polynomials. Suppose that 
 for 
. Scale by letting 
, so that 
. The orthogonality of these functions is:
Let 
 be the scaled probability distribution of 
, so:
The following theorem is evident from Equations (33) and (37), once the indexing is sorted out.
Theorem 3.  There is a duality
      
      where 
, with 
, 
, are multivariate Krawtchouk polynomials, orthogonal on 
.
 There is an interesting identity when 
u is self-dual with an indexing of 
j beginning from zero instead of one. That is:
	  Then indexing 
,
      
      where 
. This duality occurs in the scaled Krawtchouk polynomial basis, orthogonal on a binomial 
 distribution.
The emphasis in Theorem 3 is on considering the dual system, obtaining 
 from 
u; however, sometimes, it is natural to construct 
u from an orthogonal set 
, particularly when 
, 
 and 
. Then, the polynomials on the left of Equation (
40) are defined by the dual polynomials on the right. Later in the paper, it will be seen that this is natural in composition birth and death Markov processes.
The polynomial structure of the multivariate Krawtchouk polynomials is detailed in the next theorem.
Theorem 4.  Define  for .  is a polynomial of degree  in  whose only term of maximal degree  is .
 Proof.  A method of proof is to consider the transform of 
, which is given by:
	  where:
 This transform is easily found by taking the transform of the generating function Equation (28). One can see directly that 
 is an orthogonal polynomial by considering the transform:
From Equations (43) and (45), 
 is a polynomial of degree 
, whose only leading term is:
This is seen by noting that the leading term is found by replacing 
 by 
 in:
Since we can replace 
 by 
 in considering the leading term of Equation (
43) and setting 
 for 
. ☐
The next theorem explains the polynomial structure in the dual system.
Theorem 5.  Let  be such that  for , as well as the usual assumption that  for . Define , . Then,  is a polynomial of total degree  in  whose only term of maximal degree is .
 Proof.  This follows from Theorem 3, with , , and Theorem 4. ☐
 There are recurrence relationships for the multivariate Krawtchouk polynomials, which are found here from a generating function approach; for another different proof, see Theorem 6.1 in Iliev [
5]. Note that his multivariate Krawtchouk polynomials are scaled differently as
      
In Theorems 6–8, 
u is taken to be orthonormal on 
p, so 
, 
 in Equation (
25).
Theorem 6.  Denote, for 
, 
 and 
, 
. Two recursive systems are:
	  and:
	  
 Equating coefficients of 
;
      
The first recursive Equation (
49) then follows by an expansion of 
 as a series in 
 dividing the cases in Equation (
52) to obtain the coefficients by:
The second recursion Equation (
50) is found by summation, using the orthogonality of 
u. ☐
The dual orthogonal system when 
u is orthonormal is:
A dual generating function is:
The generating function Equation (
55) arises from considering the coefficient of 
 in:
Theorem 7.  A dual recurrence system is, for 
:
 Proof.  A derivation of the recurrence system uses a transform method. Consider:
 Therefore, non-zero terms with 
 are:
The dual recurrence is therefore Equation (
57). ☐
The reproducing kernel polynomials:
	  are invariant under which set of orthonormal functions 
u is used. They have an explicit form; see Diaconis and Griffiths [
2] and Xu [
7] for details.
  3.1. An Ehrenfest Urn with d-Types
A 
d-type Ehrenfest urn has 
N balls of 
d colours 
. At rate one, a ball is chosen, and if it is of type 
j, it is changed to colour 
l with probability 
, 
. 
, with 
, is the number of balls of the different colours at time 
t, which can be regarded as a 
d-dimensional random walk on 
. The transition functions have an eigenfunction expansion in the multivariate Krawtchouk polynomials, extending the case Equation (
21) with two colours.
Theorem 8.  Let 
 be a 
d-dimensional random walk on 
x, 
, where transitions are made from 
 at rate 
. 
P is a 
 transition matrix, with stationary distribution 
p, such that:
 Then, the transition functions of 
 have an eigenfunction expansion:
Proof.   is a reversible Markov process with stationary distribution 
, because it satisfies the balance equation:
 The reversibility is a consequence of assuming that 
P is a reversible transition matrix. The generator of the process acting on 
 is specified by:
		so the eigenvalues and eigenvectors 
 satisfy:
Now, from Equation (
57):
		which is the same as Equation (
65), noting that the total rate is one away from 
x. Then, Equation (
62) holds immediately. ☐
  3.2. Extensions to the Multivariate Krawtchouk Polynomials
It is useful in considering spectral expansions of composition Markov processes to allow the following generalizations of the multivariate Krawtchouk polynomials.
        
- Allow  -  as a possibility, and let  -  be a complete orthogonal set of functions on  - . The multinomial distribution is still well defined as:
             - 
            and the generating function for the multivariate Krawtchouk polynomials still holds with  - . 
- When , take  to be orthogonal on a discrete measure , which is non-negative, but not a probability measure, because . 
- Allow the basis functions  u-  to be orthogonal on  - , and take the dual functions  -  to be orthogonal on a continuous distribution. An example that occurs naturally in composition birth and death chains is when  - ,  - ,  -  are the Laguerre polynomials, orthogonal on the density:
             
  3.3. Karlin and McGregor Spectral Theory
Consider a birth and death process 
 on 
 with birth and death rates 
 from state 
i and transition probabilities 
. Negative oneis an absorbing state, which can be reached if 
. We assume that the process is non-explosive, so only a finite number of events will take place in any finite time interval. Define orthogonal polynomials 
 by:
		for 
 with 
 and 
. The polynomials are defined by recursion from Equation (
69) with 
 defined by knowing 
 and 
. If 
, then 
. There is a spectral measure 
ψ with support on the non-negative axis and total mass one, so that:
		for 
 where:
If 
, then 
 because of possible absorption into state 
. If 
, but there is no stationary distribution, because 
, then also, possibly, 
. Placing 
 shows the orthogonality of the polynomials 
 on the measure 
ψ because 
. 
 is clearly reversible with respect to 
 when a stationary distribution exists, or before absorption at zero if it does not exist, since 
. As 
 the limit stationary distribution, if 
 and 
, is:
Suppose a stationary distribution exists, and there is a discrete spectrum with support 
, 
. Then:
This is an eigenfunction expansion:
		where 
u is a set of orthonormal functions on 
p defined by:
Several well-known birth and death processes give rise to classical orthogonal polynomial systems. In this paper, only processes where 
 are considered, so there is no absorbing state at 
, and the state space is 
. Classical papers where theory is developed and particular spectral expansions Karlin and McGregor [
9,
10,
11,
18]. Schoutens [
19] details the birth and death processes and spectral expansions nicely, from which we summarize.
        
- The  queue where , .- The process has a stationary Poisson distribution:
             
 - The orthogonal polynomials are the Poisson–Charlier polynomials:
             - 
            where  -  has a generating function:
             
- The linear birth and death process where , , with .-  The process arises from individuals which split at rate  λ- , die at rate  μ-  and immigration of individuals occurs at rate  - . Then:
             
 - There are three cases to consider.
             - . The spectral polynomials are related to the Meixner polynomials by:
                 
- The polynomials are orthogonal on:
                 - 
                at points  - ,  - . The first point of increase is zero corresponding to  -  in the spectrum. There is a negative binomial stationary distribution for the process:
                 
- The Meixner polynomials have a generating function:
                 
- The polynomials are orthogonal on:
                 - 
                at points  - ,  - . The first point of increase is  - , corresponding to a spectral term  - . There is not a stationary distribution for the process in this case, with  - . 
- . The spectral polynomials are related to the Laguerre polynomials by:
                 
- In this case, there is a continuous spectrum, and the polynomials are orthogonal on the gamma distribution:
                 
- There is no stationary distribution of the process in this case. The Laguerre polynomials have a generating function:
                 
 
- A two-urn model with , , , .-  The process arises from a model with two urns with  a-  and  b-  balls, with  N-  tagged balls. At an event, two balls are chosen at random from the urns and interchanged. The state of the process is the number of tagged balls in the first urn. The spectral polynomials are related to the dual Hahn polynomials by:
             - 
            where:
             - 
            orthogonal on:
             - 
            with  - . There is a hypergeometric stationary distribution in the process of:
             
 
- An Ehrenfest urn where , , ,  and .-  The spectral polynomials are the Krawtchouk polynomials:
             - 
            orthogonal on the Binomial  -  distribution:
             - 
            which is also the stationary distribution in the process. 
 
  3.4. Composition Birth and Death Processes
Consider 
N identically distributed birth and death processes 
, 
, each with state space 
. It is assumed that there is no absorbing state at 
 and 
. The transition functions for the labelled processes are 
. In composition Markov processes, interest is in the unlabelled configuration of 
 specified by 
, where:
		for 
. The probability generating function of 
 conditional on 
 is:
		where possibly, there is a countable infinity of states with 
. Transitions and rates are, for 
,
        
The total rate from 
x is 
. 
 is reversible with respect to 
 in the sense that:
Theorem 9.  If the spectrum is discrete, with support 
, 
, 
, and a stationary distribution exists, then:
		where 
 are the multivariate Krawtchouk polynomials with:
 The indexing in elements of 
 now begins at zero. If the spectrum is discrete, with support 
, 
, then:
		where 
 are the multivariate Krawtchouk polynomials with:
In this case, 
, 
 is not identically one, and:
This covers the case when a stationary distribution does exist and also when a stationary distribution does not exist, because .
Proof.  The probabilistic structure of 
 with probability-generating function Equation (
96) implies that the multivariate Krawtchouk polynomials are the eigenfunctions of the transition distribution. Indexing in 
 is from zero, rather than the usual indexing from one. From the Karlin and McGregor spectral expansion Equation (
70):
		where 
 is defined in Equation (
100) and satisfies:
 The second case Equation (
101) follows similarly. The multivariate Krawtchouk polynomials then have a generating function:
☐
The transition probability expansion Equation (
101) can be written in a Karlin and McGregor spectral expansion form where the dual polynomials are important. Denote 
, 
; 
; and a multinomial spectral measure (which is a probability measure):
Then, Equation (
101) can be expressed as a spectral expansion:
The generating function of the dual polynomials:
		where in this generating function 
 is regarded as a random variable by taking:
 are independent and identically distributed random variables with probability measure 
ψ. Without loss of generality, take 
 in Equation (
109) and consider coefficients of 
, indexing the dual polynomial by 
 with 
. Note the scaling that the dual polynomials is one when 
, 
.
 is a polynomial of degree  in  whose only term of maximal degree is . The total degree of Z in the dual polynomials indexed by  is  with a single leading term of this degree.
Proof.  The proof of the first statement follows from Theorem 5. The proof of the second statement is immediate by knowing that  is of degree j in Z. ☐
 The third case of linear birth and death processes’ composition Markov chains is interesting, as it has a continuous spectral measure, which is a product measure of 
N gamma distribution measures. The spectral polynomials are well defined by a generating function as coefficients of 
 in:
		however, elements of 
 are distinct, being continuous random variables, and the dual of the dual system is the products of dual Laguerre polynomials, which are not grouped to an index 
n, as when there is a discrete spectrum.
The polynomials in the Meixner class Equation (
3) are additive in the sense that if 
 are the orthogonal polynomials on the distribution of 
, then the generating function for these polynomials is:
		and:
This additivity implies an interesting identity.
Theorem 11.  The dual multivariate Krawtchouk polynomials with generating function Equation (
109) satisfy the identity:
		where 
. In this equation, 
 is regarded as a random variable in the sense of Equation (
110).
 Proof.  Set 
, 
 in Equation (
109). Then:
 The theorem then follows by equating coefficients of  on both sides of the generating function. ☐