Following the approach of Rota and Taylor \cite{SIAM}, we present an innovative theory of Sheffer sequences in which the main properties are encoded by using umbrae. This syntax allows us noteworthy computational simplifications and conceptual clarifications in many results involving Sheffer sequences. To give an indication of the effectiveness of the theory, we describe applications to the well-known connection constants problem, to Lagrange inversion formula and to solving some recurrence relations.
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 are developing a Maple package of functions related to Rota's Umbral Calculus. A Mathematica version of this package is being developed in parallel.
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the recursive properties, the fundamental theorem and the connection with Sheffer sequences. In particular, we show that the fundamental theorem turns out to be a reformulation of the umbral Abel identity. As an application, we give an elementary approach to the problem of extending integer powers of Riordan arrays to complex powers in such a way that additivity of the …
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.
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 apply recent constructions of free Baxter algebras to the study of the umbral calculus. We give a characterization of the umbral calculus in terms of Baxter algebra. This characterization leads to a natural generalization of the umbral calculus that include the classical umbral calculus in a family of $λ$-umbral calculi parameterized by $λ$ in the base ring.
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.
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.
In this paper we use the viewpoint of the formal calculus underlying vertex operator algebra theory to study certain aspects of the classical umbral calculus and we introduce and study certain operators generalizing the classical umbral shifts. We begin by calculating the exponential generating function of the higher derivatives of a composite function, following a short, elementary proof which naturally arose as a motivating computation related to a certain crucial "associativity" property of an important class of vertex operator algebras. Very similar (somewhat forgotten) proofs had appeared…
One delivers here the extended Bernoulli and Taylor formula of a new sort with the rest term of the Cauchy type recently derived by the author in the case of the so called $ψ$-difference calculus which constitutes the representative for the purpose case of extended umbral calculus. The central importance of such a type formulas is beyond any doubt. Recent publications do confirm this historically established experience. Its links via umbrality to combinatorics are known at least since Rota and Mullin source papers then up to recently extended by many authors to be indicated in the sequel.
At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of uncountable family of extended difference calculus nonhomogeneous equations extends to Ward-Appell polynomials case . Illustrative specifications to q-calculus case and fibonomial calculus case are made explicit due to the usage of the so called upside down notation for objects of extended finite operator calculus .
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.
A class of extended umbral calculi in operator form is presented. Extensions of all basic theorems of classical Finite Operator Calculus are shown to hold. The impossibility of straightforward extending of quantum q-plane formulation of the q-umbral caculus to the general psi-calculus case is demonstrated.
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.
A wardian calculus of sequences started almost seventy years ago constitutes the general scheme for extensions of the classical umbral operator calculus considered by many afterwards . At the same time this calculus is an example of the algebraization of the analysis here restricted to the algebra of formal series. This is a review article based on the recent first author contributions. As the survey article it is supplemented by the short indicatory glossaries of notation and terms used by prominent contributors to the domain.
The reference links to the modern classical umbral calculus before that known as blissardian symbolic method are numerous. Rota founded and then extended finite operator calculus has links to references which are plenty numerous. The references via links to the difference q calculus umbra way treaded or without even referring to umbra are giant numerous. These reference links now result in counting in thousands the relevant papers . The purpose of the present attempt is to offer one of the keys to enter the world of those thousands of references.
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…
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…
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 …
In recent Kwasniewski's papers inspired by O. V. Viskov it was shown that the $ψ$-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota - Mullin or equivalently - of umbral calculus of Roman and Rota. At the same time this calculus is an example of the algebraization of the analysis - here restricted to the algebra of polynomials. The first part of the article is the review of the recent author's contribution. The main definitions and theorems of Finite Fibonomial Operator Calculus which is a special case of $ψ$-extented Rota's finite operat…
Trough the classical umbral calculus, we provide new, compact and easy to handle expressions of k-statistics, and more in general of U-statistics. In addition such a symbolic method can be naturally extended to multivariate case and to generalized k-statistics.
Through the classical umbral calculus, we provide a unifying syntax for single and multivariate $k$-statistics, polykays and multivariate polykays. From a combinatorial point of view, we revisit the theory as exposed by Stuart and Ord, taking into account the Doubilet approach to symmetric functions. Moreover, by using exponential polynomials rather than set partitions, we provide a new formula for $k$-statistics that results in a very fast algorithm to generate such estimators.
