Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
