Ira M. Gessel
We describe applications of the classical umbral calculus to bilinear generating functions for polynomial sequences, identities for Bernoulli and related numbers, and Kummer congruences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
Operational Umbral Calculus
本文提出了一种基于线性算子的影子微积分理论重建方法，展示了生成函数在证明高级结果中的应用，并讨论了delta算子的伪反演。
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.
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.
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.
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.
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…
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.
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 …
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 .
On formulas and fractional exponents for umbral operators
本文提出新的影算子公式，揭示其与迭代理论的联系，定义了影算子的分数次幂，并综合了操作微积分中的多项成果，扩展了拉格朗日多项式。
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.
Type-B analogue of Bell numbers using Rota's Umbral calculus approach
该研究将Rota、Tanny基于伞微积分得到的Bell数相关结果，推广到Coxeter B型集合划分框架，得到Bell数的B型类似物。
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.
Umbral calculus over a vector space
本文在任意向量空间上建立无基阴影演算，定义二项式型与谢弗序列，证明谢弗算子构成同构于里奥丹群的群，并给出代数提升方法。
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.
Transmutations from the Covariant Transform on the Heisenberg Group and an Extended Umbral Principle
本文以海森堡群Weyl代数的升降算符表示为统一框架，研究伞形演算、广义平移与嬗变及算符符号演算之间的联系，回顾经典结果并揭示新机遇。
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.
In the present article we introduce two new combinatorial interpretations of the $r$-Whitney numbers of the second kind obtained from the combinatorics of the differential operators associated to the grammar $G:=\{ y\rightarrow yx^{m}, x\rightarrow x\}$. By specializing $m=1$ we obtain also a new combinatorial interpretation of the $r$-Stirling numbers of the second kind. Again, by specializing to the case $r=0$ we introduce a new generalization of the Stirling number of the second kind and through them a binomial type family of polynomials that generalizes Touchard's. Moreover, we show severa…
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.
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…
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.
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 …
The Grammatical Calculus
介绍源自罗塔符号演算的语法演算，利用微分算子性质进行演算以推导组合恒等式和计算生成函数，语法标记是桥梁，语法可辅助构建双射，许多组合结构有上下文无关递归构造。
Poweroids revisited - an old symbolic approach
本文重审Jeffery 1861年的有限差分计算，扩展至一般delta算子，用于简洁证明多项式二项类型理论中的定理，提供紧凑的符号复合、二项性质和连接常数处理方法。
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.
$q$-Derivative Grammar
本文提出$q$-导数语法学，建立基本框架并发展计算$q$-指数生成函数的算术，用于研究$q$-欧拉、$q$-罗斯勒和$q$-安德烈多项式及其生成函数和递推关系。
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.
This paper introduces a simple and computationally efficient algorithm for conversion formulae between moments and cumulants. The algorithm provides just one formula for classical, boolean and free cumulants. This is realized by using a suitable polynomial representation of Abel polynomials. The algorithm relies on the classical umbral calculus, a symbolic language introduced by Rota and Taylor in 1994, that is particularly suited to be implemented by using software for symbolic computations. Here we give a MAPLE procedure. Comparisons with existing procedures, especially for conversions betwe…
We provide an unifying polynomial expression giving moments in terms of cumulants, and viceversa, holding in the classical, boolean and free setting. This is done by using a symbolic treatment of Abel polynomials. As a by-product, we show that in the free cumulant theory the volume polynomial of Pitman and Stanley plays the role of the complete Bell exponential polynomial in the classical theory. Moreover via generalized Abel polynomials we construct a new class of cumulants, including the classical, boolean and free ones, and the convolutions linearized by them. Finally, via an umbral Fourier…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。