Results 161 to 170 of about 166,207 (201)
Some of the next articles are maybe not open access.

The Classical Umbral Calculus

SIAM Journal on Mathematical Analysis, 1994
A rigorous presentation of the umbral calculus, as formerly applied heuristically by Blissard, Bell, Riordan, and others is given. As an application, the basic identities for Bernoulli numbers, as well as their generalizations first developed by Norlund are derived.
Gian-Carlo Rota, B. D. Taylor
openaire   +2 more sources

Umbral Calculus in Hilbert Space

1998
No abstract.
Alessandro Di Bucchianico   +2 more
openaire   +3 more sources

Some identities of the q-Laguerre polynomials on q-Umbral calculus

, 2017
Some interesting identities of Sheffer polynomials was given by Roman [11], [12]. In this paper, we study a q-analogue of Laguerre polynomials which are also q-Sheffer polynomials. Furthermore, we give some new properties and formulas of these q-Laguerre
R. Dere
semanticscholar   +1 more source

The umbral calculus on logarithmic algebras

Acta Applicandae Mathematicae, 1990
D. E. Loeb and G.-C. Rota, using the operator of differentiation D, constructed the logarithmic algebra that is the generalization of the algebra of formal Laurent series. They also introduced Appell graded logarithmic sequences and binomial (basic) graded logarithmic sequences as sequences of elements of the logarithmic algebra and extended the main ...
openaire   +2 more sources

Natural Exponential Families and Umbral Calculus

1998
We use the Umbral Calculus to investigate the relation between natural exponential families and Sheffer polynomials. As a corollary, we obtain a new transparent proof of Feinsilver’s theorem which says that natural exponential families have a quadratic variance function if and only if their associated Sheffer polynomials are orthogonal.
A. Di Bucchianico, D.E. Loeb
openaire   +3 more sources

Rota?s umbral calculus and recursions

Algebra Universalis, 2003
Umbral Calculus can provide exact solutions to a wide range of linear recursions. We summarize the relevant theory and give a variety of examples from combinatorics in one, two and three variables.
openaire   +2 more sources

Frobenius Endomorphisms in the Umbral Calculus

Studies in Applied Mathematics, 1980
Frobenius operators Fn are introduced on sequences of binomial type. The Laguerre polynomials are essentially characterized by the property that Fn coincides with n‐fold binomial convolution.
openaire   +2 more sources

The umbral calculus and orthogonal polynomials

Acta Applicandae Mathematicae, 1990
We determine all orthogonal polynomials having Boas-Buck generating functions g(t)Ψ(xf(t)), where % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy