We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged in a square matrix; in particular, the case where this matrix is a Hadamard matrix is considered. Orthogonality relations and recurrence relations are established, and coefficients for the expansion of any polynomial in terms of m-polynomials are obtained. We conclude this paper by an implementation of m-polynomials and some of the results obtained for them in Mathematica. 1. Introduction Matrices have been the subject of much study, and large bodies of results have been obtained about them. We study the interplay between the theory of matrices and the theory of orthogonal polynomials. For Krawtchouk polynomials, introduced in [1], interesting results have been obtained in [2–4]; also see the review article [5] and compare [6] for generalized Krawtchouk polynomials. More recently, conditions for the existence of integral zeros of binary Krawtchouk polynomials have been obtained in [7], while properties for generalized Krawtchouk polynomials can be found in [8]. Other generalizations of binary Krawtchouk polynomials have also been considered; for example, some properties of binary Krawtchouk polynomials have been generalised to -Krawtchouk polynomials in [9]. Orthogonality relations for quantum and -Krawtchouk polynomials have been derived in [10], and it has been shown that affine -Krawtchouk polynomials are dual to quantum -Krawtchouk polynomials. In this paper, we define and study generalizations of Krawtchouk polynomials, namely, -polynomials. The Krawtchouk polynomial is given by where is a natural number and . The generator polynomial is The generalized Krawtchouk polynomial is obtained by generalizing the above generator polynomial as follows: where , is a prime power, the are indeterminate, the field with elements is , and is a character. The above information about Krawtchouk polynomials and generalized Krawtchouk polynomials was taken from [6]. If we replace the by arbitrary scalars in the last equation, we obtain the generator polynomial of -polynomials ; see Definition 2 below. These -polynomials are the subject of study in this paper. In Section 2, we present relevant notations and definitions. In Section 3, we introduce the generator polynomial. The associated matrix of coefficients can be any square matrix, and so the question that immediately arises is how the properties of the -polynomials are related to the properties of . We will establish that, if is a generalized Hadamard matrix, then the associated -polynomials satisfy
References
[1]
M. Krawtchouk, “Sur une généralization des polynomes d'Hermite,” Comptes Rendus de l'Académie des Sciences, vol. 189, pp. 620–622, 1929.
[2]
G. Szego, Orthogonal Polynomials, vol. 23, Colloquium, New York, NY, USA, 1959.
[3]
G. K. Eagleson, “A characterization theorem for positive definite sequences on the Krawtchouk polynomials,” The Australian Journal of Statistics, vol. 11, pp. 29–38, 1969.
[4]
C. F. Dunkl, “A Krawtchouk polynomial addition theorem and wreath products of symmetric groups,” Indiana University Mathematics Journal, vol. 25, no. 4, pp. 335–358, 1976.
[5]
P. Feinsilver and J. Kocik, “Krawtchouk polynomials and Krawtchouk matrices,” in Recent Advances in Applied Probability, R. Baeza-Yates, J. Glaz, H. Gzyl, J. Hüsler, and J. L. Palacios, Eds., pp. 115–141, Springer, New York, NY, USA, 2005.
[6]
F. J. MacWilliams, N. J. A. Sloane, and J.-M. Goethals, “The MacWilliams identities for nonlinear codes,” The Bell System Technical Journal, vol. 51, pp. 803–819, 1972.
[7]
I. Krasikov and S. Litsyn, “On integral zeros of Krawtchouk polynomials,” Journal of Combinatorial Theory A, vol. 74, no. 1, pp. 71–99, 1996.
[8]
N. Sookoo, “Generalized Krawtchouk polynomials: new properties,” Archivum Mathematicum, vol. 36, no. 1, pp. 9–16, 2000.
[9]
L. Habsieger, “Integer zeros of q-Krawtchouk polynomials in classical combinatorics,” Advances in Applied Mathematics, vol. 27, no. 2-3, pp. 427–437, 2001.
[10]
M. N. Atakishiyev and V. A. Groza, “The quantum algebra and -Krawtchouk families of polynomials,” Journal of Physics A, vol. 37, no. 7, pp. 2625–2635, 2004.
[11]
P. Delsarte, “An algebraic approach to the association schemes of coding theory,” Philips Research Reports, no. 10, 97 pages, 1973.
[12]
J. D. Louck, “Group theory of harmonic oscillators in -dimensional space,” Journal of Mathematical Physics, vol. 6, pp. 1786–1804, 1965.
[13]
W. Y. C. Chen and J. D. Louck, “The combinatorics of a class of representation functions,” Advances in Mathematics, vol. 140, no. 2, pp. 207–236, 1998.
[14]
V. I. Levenshtein, “Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces,” IEEE Transactions on Information Theory, vol. 41, no. 5, pp. 1303–1321, 1995.
[15]
F. J. MacWilliams and N. J. A. Sloane, Theory of Error-Correcting Codes, North-Holland, New York, NY, USA, 1978.
[16]
L. Boelen, G. Filipuk, C. Smet, W. Van Assche, and L. Zhang, “The generalized Krawtchouk polynomials and the fifth Painleve equation,” Journal of Difference Equations and Applications, vol. 19, pp. 1437–1451, 2013.
[17]
J. Sheeba Rani and D. Devaraj, “Face recognition using Krawtchouk moment,” Sādhanā, vol. 37, no. 4, pp. 441–460, 2012.
