Premium
Combinatorics for Wavelets: The Umbral Refinement Equation
Author(s) -
Shen Jianhong
Publication year - 1999
Publication title -
studies in applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 46
eISSN - 1467-9590
pISSN - 0022-2526
DOI - 10.1111/1467-9590.00123
Subject(s) - wavelet , mathematics , invariant (physics) , calculus (dental) , context (archaeology) , algebra over a field , pure mathematics , computer science , artificial intelligence , mathematical physics , medicine , paleontology , dentistry , biology
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.