In mathematics, Krawtchouk matrices are matrices whose entries are values of Krawtchouk polynomials at nonnegative integer points.
The first few Krawtchouk matrices are: In general, for positive integer
are given by the generating function: where the row and column indices
Explicitly: or in terms of the Krawtchouk polynomials: The values of a Krawchouk matrix can also be calculated using a recurrence relation.
Filling the top row with ones and the rightmost column with alternating binomial coefficients, the other entries are each given by the sum of the neighbouring entries to the top, topright and right.
[3] The Krawtchouk polynomials are orthogonal with respect to symmetric binomial distributions,
[4] As a transformation, a Krawtchouk matrix is an involution up to scaling: Krawchouk matrices have an LDU decomposition involving triangular Pascal matrices and a diagonal matrix of the powers of 2.
This article about matrices is a stub.
You can help Wikipedia by expanding it.