相关论文: A triple lacunary generating function for Hermite …
We give new explicit representations as well as new generating functions for the associated Meixner, Charlier, Laguerre, and Krawtchouk polynomials. The obtained results are then used to derive new generating functions and convolution-type…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
In this paper we use a set of partial differential equations to prove an expansion theorem for multiple complex Hermite polynomials. This expansion theorem allows us to develop a systematic and completely new approach to the complex Hermite…
The aim of this work is to characterize all generating functions of the form $A(t)F(xtA(t)-R(t))$ for the classical orthogonal polynomials. Further generating functions are also provided by derivation.
Recently there has been a renewed interest in an extension of the notion of orthogonal polynomials known as multiple orthogonal polynomials. This notion comes from simultaneous rational approximation (Hermite-Pade approximation) of a system…
It is shown that several of Brafman's generating functions for the Gegenbauer polynomials are algebraic functions of their arguments, if the Gegenbauer parameter differs from an integer by one-fourth or one-sixth. Two examples are given,…
We show how to represent various families of Laguerre polynomials by the three-dimensional Riordan arrays, and use the fundamental theorem of Riordan arrays to obtain the corresponding exponential generating functions.
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
The exponential generating function of ordinary generating functions of diagonal sequences of general Sheffer triangles is computed by an application of Lagrange's theorem. For the special Jabotinsky type this is already known. An analogous…
For use in calculating higher-order coherent- and squeezed- state quantities, we derive generalized generating functions for the Hermite polynomials. They are given by $\sum_{n=0}^{\infty}z^{jn+k}H_{jn+k}(x)/(jn+k)!$, for arbitrary integers…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We obtain q-analogues of the Sylvester, Ces\`aro, Pasternack, and Bateman polynomials. We also derive generating functions for these polynomials.
In this paper, we study generating functions of Erd\'{e}lyi's multivariate Laguerre polynomials $L_{n_1,\cdots,n_k}^{(\alpha)}(x_1,\cdots,x_k)$ with a varying complex parameter. Our main result is a multiple generating function from which…
We present the first systematic extension of the classical Hermite-Laguerre quadratic correspondence to the matrix-valued setting. Starting from a Hermite-type weight matrix W(x) = exp(-x^2) Z(x) with W(x) = W(-x), the change of variables y…
The method of constructing Hermite trigonometric polynomials, which interpolate the values of a certain periodic function and its derivatives up to (including ) the -th ( ) order in nodes of a uniform grid, is considered. The proposed…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
We show that the only orthogonal polynomials with a generating function of the form $F(x z - \alpha z^2)$ are the ultraspherical, Hermite, and Chebyshev polynomials of the first kind. For special $F$ for which this is the case, we then…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…