Related papers: Generating functions for the osp(1|2) Clebsch-Gord…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
The paper contains the derivation of a general set of recurrence formulas for the calculus of the SU(3) Clebsch-Gordan coefficients. The first six sections are introductory, presenting the notations and placing SU(3) in the framework of the…
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
Let $D\geq 1$ and $q\geq 3$ be two integers. Let $H(D)=H(D,q)$ denote the $D$-dimensional Hamming graph over a $q$-element set. Let ${\mathcal T}(D)$ denote the Terwilliger algebra of $H(D)$. Let $V(D)$ denote the standard ${\mathcal…
Motivated by the classical ideas of generating functions for orthogonal polynomials, we initiate a new line of investigation on "generating operators" for a family of differential operators between two manifolds. We prove a novel formula of…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
The gap probability generating function has as its coefficients the probability of an interval containing exactly $k$ eigenvalues. For scaled random matrices with orthogonal symmetry, and the interval at the hard or soft spectrum edge, the…
A C-Language program which tabulates the isoscalar factors and Clebsch-Gordan coefficients for products of representations in SU(3) is presented. These are efficiently computed using recursion relations, and the results are presented in…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
The Brenke type generating functions are the polynomial generating functions of the form $$\sum_{n=0}^{\infty}{P_n(x )\over n!}t^n=A(t)B(xt), $$ where $A$ and $B$ are two formal power series subject to the conditions…
We present a program that allows for the computation of tensor products of irreducible representations of Lie algebras A-G based on the explicit construction of weight states. This straightforward approach (which is slower and more…
For a two parameter family of Bernoulli numbers $B_{n, p}$ the exponential generating function is derived by elementary methods.
We write a generating function for all spherical functions on the product of several copies of SU(2).
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…
Using the Fronsdal-Galindo formula for the exponential mapping from the quantum algebra $U_{p,q}(gl(2))$ to the quantum group $GL_{p,q}(2)$, we show how the $(2j+1)$-dimensional representations of $GL_{p,q}(2)$ can be obtained by…
Using realisations of the positive discrete series representations of the Lie algebra su(1,1) in terms of Meixner-Pollaczek polynomials, the action of su(1,1) on Poisson kernels of these polynomials is considered. In the tensor product of…
The addition of angular momenta can be reduced to elementary coupling processes of spin-$\frac{1}{2}$-particles. In this way, a method is developed which allows for a non-recursive, simultaneous computation of all Clebsch-Gordan…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.