Related papers: A Matricial Algorithm for Polynomial Refinement
Research on refinable functions in wavelet theory is mostly focused to localized functions. However it is known, that polynomial functions are refinable, too. In our paper we investigate on conversions between refinement masks and…
The multiresolution analysis of Alpert is considered. Explicit formulas for the entries in the matrix coefficients of the refinement equation are given in terms of hypergeometric functions. These entries are shown to solve generalized…
A refinement of manifold data is a computational process, which produces a denser set of discrete data from a given one. Such refinements are closely related to multiresolution representations of manifold data by pyramid transforms, and…
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all…
The regularity of refinable functions has been analysed in an extensive literature and is well-understood in two cases: 1) univariate 2) multivariate with an isotropic dilation matrix. The general (non-isotropic) case offered a great…
We start by presenting a generalization of a discrete wave equation that is particularly satisfied by the entries of the matrix coefficients of the refinement equation corresponding to the multiresolution analysis of Alpert. The entries are…
The regularity of refinable functions has been studied extensively in the past. A classical result by Daubechies and Lagarias states that a compactly supported refinable function in $\R$ of finite mask with integer dilation and translations…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
We give a characterization of all Parseval wavelet frames arising from a given frame multiresolution analysis. As a consequence, we obtain a description of all Parseval wavelet frames associated with a frame multiresolution analysis. These…
We derive relations between geometric means of the Fourier moduli of a refinable distribution and of a related polynomial. We use Pisot-Vijayaraghavan numbers to construct families of one dimension quasilattices and multiresolution analyses…
A simple greedy refinement procedure for the generation of data-adapted triangulations is proposed and studied. Given a function of two variables, the algorithm produces a hierarchy of triangulations and piecewise polynomial approximations…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
In the present paper, multiscale systems of polynomial wavelets on an n-dimensional sphere are constructed. Scaling functions and wavelets are investigated,and their reproducing and localization properties and positive definiteness are…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two…
Using the Daubechies conditions of compact support, orthogonal, and regularity, we were able to derive bivariate scaling functions with which to reproduce linear functions (planes). We describe how to create all possible masks of refinement…
We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…
In the paper we obtain sufficient conditions for a trigonometric polynomial to be a refinement mask corresponding to a tight wavelet frame. The condition is formulated in terms of the roots of a mask. In particular, it is proved that any…
The notion of {\em $p$-adic multiresolution analysis (MRA)} is introduced. We discuss a ``natural'' refinement equation whose solution (a refinable function) is the characteristic function of the unit disc. This equation reflects the fact…
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…