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} )
From MaRDI portal
Publication:4123784
Cited in
(21)- Askey-Wilson polynomials, kernel polynomials and association schemes
- On Foulkes characters
- Quadratic and symmetric bilinear forms over finite fields and their association schemes
- q-rotations and Krawtchouk polynomials
- Bilinear forms over a finite field, with applications to coding theory
- Zeros of generalized Krawtchouk polynomials
- Subset representations and eigenvalues of the universal intertwining matrix
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- A partially ordered set and q-Krawtchouk polynomials
- Cameron-Liebler sets in bilinear forms graphs
- Symmetric bilinear forms over finite fields with applications to coding theory
- Three addition theorems for some q-Krawtchouk polynomials
- Classical orthogonal polynomials of a discrete variable on nonuniform lattices
- On the cardinality of matrices with prescribed rank and partial trace over a finite field
- Hyperplane sections of determinantal varieties over finite fields and linear codes
- The MacWilliams identity for the skew rank metric
- Character tables of association schemes based on attenuated spaces
- Kravchuk polynomials and group representations
- On classical orthogonal polynomials
- Subschemes of the Johnson scheme
- Algebraic codes for network coding
This page was built for publication: 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} )$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123784)
