Downloads & Free Reading Options - Results

We discuss umbral calculus as a method of systematically discretizing linear differential equations while preserving their point symmetries as well as generalized symmetries. The method is then applied to the Schr\"{o}dinger equation in order to obtain a realization of nonrelativistic quantum mechanics in discrete space-time. In this approach a quantum system on a lattice has a symmetry algebra isomorphic to that of the continuous case. Moreover, systems that are integrable, superintegrable or exactly solvable preserve these properties in the discrete case.

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 $\psi$-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.

In this note we derive the Q-difference Bernoulli-Taylor formula with the rest term of the Cauchy form by the Viskov's method. This is an extension of technique by the use of Q-extented Kwasniewski's *-product . The main theorems of Q-umbral calculus were given by G. Markowsky in 1968 and extented by A.K.Kwasniewski.

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.

David Goss developed a very general Fourier transform in additive harmonic analysis in the function field setting. In order to introduce the Fourier transform for continuous characteristic $p$ valued functions on $\mathbb{Z}_p$, Goss introduced and studied an analogue of flows in finite characteristic. In this paper, we use another approach to study flows in finite characteristic. We recast the notion of a flow in the language of the classical umbral calculus, which allows to generalize the formula for flows first proved by Goss to a more general setting. We study duality between flows using the classical umbral calculus, and show that the duality notion introduced by Goss seems a natural one. We also formulate a question of Goss about the exact relationship between two flows of a Drinfeld module in the language of the classical umbral calculus, and give a partial answer to it.

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 exponents is preserved. Also, ordinary Riordan arrays are studied within the classical umbral perspective and some combinatorial identities are discussed regarding Catalan numbers, Fibonacci numbers and Chebyshev polynomials.

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.