Related papers: Superoscillations with arbitrary polynomial shape
We give an explicit formula, as a formal differential operator, for quantum microformal morphisms of (super)manifolds that we introduced earlier. Such quantum microformal morphisms are essentially oscillatory integral operators or Fourier…
Several properties of stationary subdivision schemes are nowadays well understood. In particular, it is known that the polynomial generation and reproduction capability of a stationary subdivision scheme is strongly connected with sum…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
We introduce the one-dimensional PT-symmetric Schrodinger equation, with complex potentials in the form of the canonical superoscillatory and suboscillatory functions known in quantum mechanics and optics. While the suboscillatory-like…
We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an…
Given the importance of floating-point~(FP) performance in numerous domains, several new variants of FP and its alternatives have been proposed (e.g., Bfloat16, TensorFloat32, and Posits). These representations do not have correctly rounded…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…
In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…
We call a function "constructible" if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. Our main theorem…
We characterize, up to a conjecture, probability distributions of all order finite moments having ultraspherical type generating functions for orthogonal polynomials.
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…
We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…
Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…
Fourier extension is an approximation scheme in which a function on an arbitary bounded domain is approximated using a classical Fourier series on a bounding box. On the smaller domain the Fourier series exhibits redundancy, and it has the…
Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…
In this article, we give a sequence of operators for producing an approximation result. The relation between the rate of approximation of sequence operators including Dunkl variant of exponential function with first and second-order modulus…