Krawtchouk matrices
In mathematics, Krawtchouk matrices are matrices whose entries are values of Krawtchouk polynomials at nonnegative integer points.[1][2] The Krawtchouk matrix K(N) is an (N + 1) × (N + 1) matrix. The first few Krawtchouk matrices are:
- [math]\displaystyle{ K^{(0)} = \begin{bmatrix} 1 \end{bmatrix}, \qquad K^{(1)} = \left[ \begin{array}{rr} 1 & 1 \\ 1 & -1 \end{array} \right], \qquad K^{(2)} = \left[ \begin{array}{rrr} 1 & 1 & 1 \\ 2 & 0 & -2 \\ 1 & -1 & 1 \end{array} \right], \qquad K^{(3)} = \left[ \begin{array}{rrrr} 1 & 1 & 1 & 1 \\ 3 & 1 & -1 & -3 \\ 3 & -1 & -1 & 3 \\ 1 & -1 & 1 & -1 \end{array} \right], }[/math]
- [math]\displaystyle{ K^{(4)} = \left[ \begin{array}{rrrrr} 1 & 1 & 1 & 1 & 1 \\ 4 & 2 & 0 & -2 & -4 \\ 6 & 0 & -2 & 0 & 6 \\ 4 & -2 & 0 & 2 & -4 \\ 1 & -1 & 1 & -1 & 1 \end{array} \right], \qquad K^{(5)} = \left[ \begin{array}{rrrrrr} 1 & 1 & 1 & 1 & 1 & 1 \\ 5 & 3 & 1 & -1 & -3 & -5 \\ 10 & 2 & -2 & -2 & 2 & 10 \\ 10 & -2 & -2 & 2 & 2 & -10 \\ 5 & -3 & 1 & 1 & -3 & 5 \\ 1 & -1 & 1 & -1 & 1 & -1 \end{array} \right]. }[/math]
Definition
In general, for positive integer [math]\displaystyle{ N }[/math], the entries [math]\displaystyle{ K^{(N)}_{ij} }[/math] are given by the generating function:
- [math]\displaystyle{ (1 + v)^{N-j}\,(1 - v)^j = \sum_i v^i K^{(N)}_{ij}, }[/math]
where the row and column indices [math]\displaystyle{ i }[/math] and [math]\displaystyle{ j }[/math] run from [math]\displaystyle{ 0 }[/math] to [math]\displaystyle{ N }[/math]. Explicitly:
- [math]\displaystyle{ K^{(N)}_{ij} = \sum_k (-1)^k \binom{j}{k} \binom{N - j}{i - k}, }[/math]
or in terms of the Krawtchouk polynomials:
- [math]\displaystyle{ K^{(N)}_{ij} = \kappa_i(j, N). }[/math]
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]
Properties
The Krawtchouk polynomials are orthogonal with respect to symmetric binomial distributions, [math]\displaystyle{ p = 1/2 }[/math].[4]
As a transformation, a Krawtchouk matrix is an involution up to scaling:
- [math]\displaystyle{ (K^{(N)}_{ij})^2 = 2^N I. }[/math]
Krawchouk matrices have an LDU decomposition involving triangular Pascal matrices and a diagonal matrix of the powers of 2.[5]
The eigenvalues are [math]\displaystyle{ \pm \sqrt{2^n} }[/math], and the determinant is [math]\displaystyle{ (-2)^{n(n+1)/2} }[/math].[5]
See also
- Krawtchouk polynomial
- Pascal matrix
References
- ↑ Bose, N. (1985). Digital Filters: Theory and Applications. New York: North-Holland Elsevier. ISBN 0-444-00980-9.
- ↑ Feinsilver, P.; Kocik, J. (2004). Krawtchouk polynomials and Krawtchouk matrices. Recent Advances in Applied Probability. Springer-Verlag. Bibcode: 2007quant.ph..2073F.
- ↑ Feinsilver, P.; Kocik, J. (2007). "Krawtchouk matrices from classical and quantum random walks". arXiv:quant-ph/0702173.
- ↑ "Hahn Class: Definitions". Digital Library of Mathematical Functions. http://dlmf.nist.gov/18.19.
- ↑ 5.0 5.1 Boyd, Geoff; Micchelli, Charles A.; Strang, Gilbert; Zhou, Ding-Xuan (2001). "Binomial Matrices" (in en). Advances in Computational Mathematics 14 (4): 379–391. doi:10.1023/A:1012207124894. ISSN 1572-9044. https://www.academia.edu/9731547.
External links
 |  |
