Properties and Applications of the Recurrence $F( {i + 1,k + 1,n + 1} ) = q^{k + 1} F( {i,k + 1,n} ) - q^k F( {i,k,n} )$
Author:
- Philippe DelsartePDPhilippe Delsarte
- 1 September 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 31 (2) , 262-270
Abstract
The above recurrence formula occurs in the algebraic theory of certain association schemes. Explicit solutions are given in terms of Gaussian binomial coefficients. In particular, some generalized Krawtchouk and Eberlein polynomials are examined in this context.Keywords
This publication has 15 references indexed in Scilit:
- Association schemes and t-designs in regular semilatticesJournal of Combinatorial Theory, Series A, 1976
- Alternating bilinear forms over GF(q)Journal of Combinatorial Theory, Series A, 1975
- Applications of Basic Hypergeometric FunctionsSIAM Review, 1974
- Krawtchouk Polynomials and the Symmetrization of HypergroupsSIAM Journal on Mathematical Analysis, 1974
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973
- On the q-analog of Kummer’s theorem and applicationsDuke Mathematical Journal, 1973
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating FunctionsStudies in Applied Mathematics, 1970
- A CHARACTERIZATION THEOREM FOR POSITIVE DEFINITE SEQUENCES ON THE KRAWTCHOUK POLYNOMIALS1Australian Journal of Statistics, 1969
- A two parameter test matrixMathematics of Computation, 1964
- On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced DesignsThe Annals of Mathematical Statistics, 1959