Using random variables as motivation, this paper presents an exposition of the formalisms developed by Rota and Taylor for the classical umbral calculus. A variety of examples are presented, culminating in several descriptions of sequences of binomial type in terms of umbral polynomials.
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any polynomial sequence of binomial type. This leads to some new expansions of the chromatic polynomial. We also describe a set map generalization of Abel polynomials.
Extending the rigorous presentation of the classical umbral calculus given by Rota and Taylor in 1994, the so-called partition polynomials are interpreted with the aim to point out the umbral nature of the Poisson random variables. Among the new umbrae introduced, the main tool is the partition umbra that leads also to a simple expression of the functional composition of the exponential power series. Moreover a new short proof of the Lagrange inversion formula is given.
We introduce new generalizations of the Bernoulli, Euler, and Genocchi polynomials and numbers based on the Carlitz-Tsallis degenerate exponential function and concepts of the Umbral Calculus associated with it. Also, we present generalizations of some familiar identities and connection between these kinds of Bernoulli, Euler, and Genocchi polynomials. Moreover, we establish a new analogue of the Euler identity for the degenerate Bernoulli numbers.
One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost automatically. The reason for that is just the proper framework of the generalized finite operator calculus recently being developed by the present author.
We describe applications of the classical umbral calculus to bilinear generating functions for polynomial sequences, identities for Bernoulli and related numbers, and Kummer congruences.
An umbral calculus over local fields of positive characteristic is developed on the basis of a relation of binomial type satisfied by the Carlitz polynomials. Orthonormal bases in the space of continuous $\mathbb F_q$-linear functions are constructed.
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence relation for the polynomial sequences associated to the so called generalized umbral calculus.
Hypergeometric functions and zonal polynomials are the tools usually addressed in the literature to deal with the expected value of the elementary symmetric functions in non-central Wishart latent roots. The method here proposed recovers the expected value of these symmetric functions by using the umbral operator applied to the trace of suitable polynomial matrices and their cumulants. The employment of a suitable linear operator in place of hypergeometric functions and zonal polynomials was conjectured by de Waal in 1972. Here we show how the umbral operator accomplishes this task and consequ…
Inspired by ideas from umbral calculus and based on the two types of integrals occurring in the defining equations for the gamma and the reciprocal gamma functions, respectively, we develop a multi-variate version of umbral calculus and of the so-called umbral image technique. Besides providing a class of new formulae for generalized hypergeometric functions and an implementation of series manipulations for computing lacunary generating functions, our main application of these techniques is the study of Sobolev-Jacobi polynomials. Motivated by applications to theoretical chemistry, we moreover…
In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-π,π]}$. The Hamiltonian is $h(ϕ)=\sum_{n=0}^\infty p_n'(0)/n! e^{inϕ}$ and it produces a Schrödinger type equation for $p_n(x)$. This establishes a bridge between enumerative combinatorics and quantum field theory. It also provides an algorithm for parallel quantum computations. Keywords: Feynman path integral, umbral calculus, polynomial sequence of binomial type, token, Schrödinger …
A calculus of sequences started in 1936 opened the way for future extensions of umbral calculus in its finite operator form. Because of historically established notation we call it the psi-calculus.It appears in parts to be almost automatic extension of the standard classical finite operator calculus.
We study the effect of linear transformations on quantum fields with applications to vertex operator presentations of symmetric functions. Properties of linearly transformed quantum fields and corresponding transformations of Hall-Littlewood polynomials are described, including preservation of commutation relations, stability, explicit combinatorial formulas and generating functions. We prove that specializations of linearly transformed Hall-Littlewood polynomials describe all polynomial tau functions of the KP and the BKP hierarchy. Examples of linear transformations are related to multiparam…
We propose new algorithms for generating $k$-statistics, multivariate $k$-statistics, polykays and multivariate polykays. The resulting computational times are very fast compared with procedures existing in the literature. Such speeding up is obtained by means of a symbolic method arising from the classical umbral calculus. The classical umbral calculus is a light syntax that involves only elementary rules to managing sequences of numbers or polynomials. The cornerstone of the procedures here introduced is the connection between cumulants of a random variable and a suitable compound Poisson ra…
Skew stable Grothendieck polynomials are $K$-theoretic analogues of skew Schur polynomials. We give a free-fermionic presentation of skew stable Grothendieck polynomials and their dual symmetric functions. By using our presentation, we derive a family of determinantal formulas, which are $K$-analogues of the Jacobi-Trudi formula for skew Schur functions. We also introduce a combinatorial method to calculate certain expansions of skew (dual) stable Grothendieck polynomials by using the non-commutative supersymmetric Schur functions.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.