Combinatorics for Wavelets: The Umbral Refinement Equation

The refinement equation is the most fundamental equation in wavelet theory.In this article, we study its combinatorial meanings and analogs. We show that the invariant properties of the Cauchy generating function are well adapted to the translation and dilation operators in the refinement equation. This leads to the discovery of analytic scaling functions and wavelets. The classical umbral calculus (or symbolic calculus) provides a powerful tool for moments analysis and defines the combinatorial analog of the ordinary refinement equation—the umbral refinement equation. By developing the existing theory of classical umbral calculus, we are able to solve the umbral refinement equation in a purely umbral manner. Many classical results in wavelet analysis are reestablished in the context of umbral calculus.     

Continuous Sheffer families II

Continuous Sheffer families have been recently introduced by the authors. These are continuous versions of the Sheffer sequences arising in the umbral calculus. We show here that quite a number of classical special functions are examples of such families.     

Identities among certain triangular matrices

The object of this paper is to develop the ideas introduced in the author's paper [1] on matrices which generate families of polynomials and associated infinite series. A family of infinite one-subdiagonal non-commuting matrices Q_m is defined, and a number of identities among its members are given. The matrix Q₁ is applied to solve a problem concerning the derivative of a family of polynomials, and it is shown that the solution is remarkably similar to a conventional solution employing a scalar generating function. Two sets of infinite triangular matrices are then defined. The elements of one set are related to the terms of Laguerre, Hermite, Bernoulli, Euler, and Bessel polynomials, while the elements of the other set consist of Stirling numbers of both kinds, the two-parameter Eulerian numbers, and numbers introduced in a note on inverse scalar relations by Touchard. It is then shown that these matrices are related by a number of identities, several of which are in the form of similarity transformations. Some well-known and less well-known pairs of inverse scalar relations arising in combinatorial analysis are shown to be derivable from simple and obviously inverse pairs of matrix relations. This work is an explicit matrix version of the umbral calculus as presented by Rota et al. [24-26].     

Hopf algebras of set systems

Hopf algebras play a major rôle in such diverse mathematical areas as algebraic topology, formal group theory, and theoretical physics, and they are achieving prominence in combinatorics through the influence of G.-C. Rota and his school. Our primary purpose in this article is to build on work of Schmitt [18,19], and establish combinatorial models for several of the Hopf algebras associated with umbral calculus and formal group laws. In so doing, we incorporate and extend certain invariants of simple graphs such as the umbral chromatic polynomial, and Stanley's [21] recently introduced symmetric function. Our fundamental combinatorial components are finite set systems, together with a versatile generalization in which they are equipped with a group of automorphisms. Interactions with the Roman-Rota umbral calculus over graded rings of scalars which may contain torsion are a significant feature of our presentation.     

哑运算的概率解释

利用随机变量的矩以及期望运算,给出了哑运算一种简单、自然的概率解释,并且得到了Abel恒等式的一个广泛哑运算证明.     

Recurrence relations for polynomial sequences via Riordan matrices

We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences for 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 polynomial families. 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.     

The umbral calculus on logarithmic algebras

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 results of the classical umbral calculus on such sequences. We construct an algebra by an operator d that is defined by the formula (1.1). This algebra is an analog of the logarithmic algebra. Then we define sequences analogous to Boas-Buck polynomial sequences and extend the main results of the nonclassical umbral calculus on such sequences. The basic logarithmic algebra constructed by the operator of q-differentiation is considered. The analog of the q-Stirling formula is obtained.     

Some identities of Bell polynomials

We investigate Bell polynomials, also called Touchard polynomials or exponential polynomials, by using and without using umbral calculus. We use three different formulas in order to express various known families of polynomials such as Bernoulli polynomials, poly-Bernoulli polynomials, Cauchy polynomials and falling factorials in terms of Bell polynomials and vice versa. In addition, we derive several properties of Bell polynomials along the way.     

Operatormethoden fürq-Identitäten II:q-Laguerre-Polynome

Someq-analogues of the classical Laguerre-polynomials are studied from the point of view of umbral calculus.     

Integration in the umbral calculus

The adjointness between “multiplication” and “derivation” is a recurrent theme in Rota's umbral calculus. The subject of this paper is the companion adjointness between “division” and “integration.”     

A new approach to Sheppard’s corrections

A very simple closed-form formula for Sheppard’s corrections is recovered by means of the classical umbral calculus. Using this symbolic method, a more general closed-form formula for discrete parent distributions is provided and the generalization to the multivariate case turns out to be straightforward. All these new formulas are particularly suited to be implemented in any symbolic package.     

Pascal算子矩阵在组合恒等式中的应用(英文)

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Pascal算子矩阵在组合恒等式中的应用

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

A context-free grammar for the e-positivity of the trivariate second-order Eulerian polynomials

Ma-Ma-Yeh made a beautiful observation that a transformation of the grammar of Dumont instantly leads to the γ-positivity of the Eulerian polynomials. We notice that the transformed grammar bears a striking resemblance to the grammar for 0-1-2 increasing trees also due to Dumont. The appearance of the factor of two fits perfectly in a grammatical labeling of 0-1-2 increasing plane trees. Furthermore, the grammatical calculus is instrumental to the computation of the generating functions. This approach can be adapted to study the e-positivity of the trivariate second-order Eulerian polynomials first introduced by Dumont in the contexts of ternary trees and Stirling permutations, and independently defined by Janson, in connection with the joint distribution of the numbers of ascents, descents and plateaux over Stirling permutations.     

Three-colourings of planar 4-valent maps

A strong face 3-colouring of a planar 4-valent map G is a 3-colouring of the faces such that there is a face of each colour at every vertex. Such a map is one-track if it contains an Eulerian path which at each vertex regarded as a cross-roads goes directly through. It is proved that every planar 4-valent map can be strongly face 3-coloured and this can be done in a unique way if and only if G is one-track. Formulas are obtained for the number of strong face 3-colourings and the number of all face 3-colourings.     

A new algorithm for computing the multivariate Faà di Bruno’s formula

A new algorithm for computing the multivariate Faà di Bruno’s formula is provided. We use a symbolic approach based on the classical umbral calculus that turns the computation of the multivariate Faà di Bruno’s formula into a suitable multinomial expansion. We propose a MAPLE procedure whose computational times are faster compared with the ones existing in the literature. Some illustrative applications are also provided.     

Applications of the classical umbral calculus

We describe applications of the classical umbral calculus to bilinear generating functions for polynomial sequences, identities for Bernoulli and related numbers, and Kummer congruences.Dedicated to the Memory of Gian-Carlo Rota     

The Dattoli-Srivastava conjectures concerning generating functions involving the harmonic numbers

In a recent paper Dattoli and Srivastava [3], by resorting to umbral calculus, conjectured several generating functions involving harmonic numbers. In this sequel to their work our aim is to rigorously demonstrate the truth of the Dattoli-Srivastava conjectures by making use of simple analytical arguments. In addition, one of these conjectures is stated and proved in more general form.     

Extended finite operator calculus—an example of algebraization of analysis

“A Calculus of Sequences” started in 1936 by Ward constitutes the general scheme for extensions of classical operator calculus of Rota—Mullin considered by many afterwards and after Ward. Because of the notation we shall call the Ward's calculus of sequences in its afterwards elaborated form—a ψ-calculus. 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. Many of the results of ψ-calculus may be extended to Markowsky Q-umbral calculus where Q stands for a generalized difference operator, i.e. the one lowering the degree of any polynomial by one. This is a review article based on the recent first author contributions [1]. As the survey article it is supplemented by the short indicatory glossaries of notation and terms used by Ward [2], Viskov [7, 8], Markowsky [12], Roman [28–32] on one side and the Rota-oriented notation on the other side [9–11, 1, 3, 4, 35] (see also [33]).     

Stable multivariate W-Eulerian polynomials

We prove a multivariate strengthening of Brenti?s result that every root of the Eulerian polynomial of type B is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability—a generalization of real-rootedness to polynomials in multiple variables. The key is that our refined multivariate Eulerian polynomials satisfy a recurrence given by a stability-preserving linear operator.Our results extend naturally to colored permutations, and we also give stable generalizations of recent real-rootedness results due to Dilks, Petersen, and Stembridge on affine Eulerian polynomials of types A and C. Finally, although we are not able to settle Brenti?s real-rootedness conjecture for Eulerian polynomials of type D, nor prove a companion conjecture of Dilks, Petersen, and Stembridge for affine Eulerian polynomials of types B and D, we indicate some methods of attack and pose some related open problems.