Related papers: On Krawtchouk Transforms
A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
The relation between the spectral decomposition of a self-adjoint operator which is realizable as a higher order recurrence operator and matrix-valued orthogonal polynomials is investigated. A general construction of such operators from…
A review on the Chandrasekhar polynomials is given. The polynomials often appear in transport theory. The relation to the method of rotated reference frames for the three-dimensional radiative transport equation is clarified.
Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of…
This publication is an exercise which extends to two variables the Christoffel's construction of orthogonal polynomials for potentials of one variable with external sources. We generalize the construction to biorthogonal polynomials. We…
Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…
Novel types of convolution operators for quaternion linear canonical transform (QLCT) are proposed. Type one and two are defined in the spatial and QLCT spectral domains, respectively. They are distinct in the quaternion space and are…
The weight distribution of an error correcting code is a crucial statistic in determining it's performance. One key tool for relating the weight of a code to that of it's dual is the MacWilliams Identity, first developed for the Hamming…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…
We consider Koornwinder's method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder's construction…
Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…
We present an algorithmic proof of the Cartan-Dieudonn\'e theorem on generalized real scalar product spaces with arbitrary signature. We use Clifford algebras to compute the factorization of a given orthogonal transformation as a product of…
We extend the well-known Melzak binomial transform formula to polynomials of any degree and show some applications.
The paper extends the classical result on the convergence of the Krawtchouk polynomials to the Hermite polynomials. We provide the uniform asymptotic expansion in terms of the Hermite polynomials. We explicitly obtain expressions for a few…
In this article, we consider the Christoffel transformations for skew-orthogonal polynomials and partial-skew-orthogonal polynomials. We demonstrate that the Christoffel transformations can act as spectral problems for discrete integrable…
The quantum state transfer properties of a class of two-dimensional spin lattices on a triangular domain are investigated. Systems for which the 1-excitation dynamics is exactly solvable are identified. The exact solutions are expressed in…
We study the generalization of shifted Jack polynomials to arbitrary multiplicity free spaces. In a previous paper (math.RT/0006004) we showed that these polynomials are eigenfunctions for commuting difference operators. Our central result…
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…