Related papers: Fourier transforms of polytopes, solid angle sums,…
We develop an exact wavelet transform on the three-dimensional ball (i.e. on the solid sphere), which we name the flaglet transform. For this purpose we first construct an exact transform on the radial half-line using damped Laguerre…
The Cholesky factorization of the moment matrix is applied to discrete orthogonal polynomials on the homogeneous lattice. In particular, semiclassical discrete orthogonal polynomials, which are built in terms of a discrete Pearson equation,…
Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical…
In this note, we study the general form of a multiplicative bijection on several families of functions defined on manifolds, both real or complex valued. In the real case, we prove that it is essentially defined by a composition with a…
The famous Fourier theorem states that, under some restrictions, any periodic function (or real world signal) can be obtained as a sum of sinusoids, and hence, a technique exists for decomposing a signal into its sinusoidal components. From…
We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…
We consider the integer point transform $\sigma _P (\mathbf{x}) = \sum _{\mathbf{m} \in P\cap \mathbb{Z}^n} \mathbf{x}^\mathbf{m} \in \mathbb C [x_1^{\pm 1},\ldots, x_n^{\pm 1}]$ of a polytope $P\subset \mathbb{R}^n$. We show that if $P$ is…
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…
We present explicit representations in terms of hypergeometric functions for the scaling functions in the $C^0$ orthogonal multiresolution analyses associated with piecewise continuous polynomials. Closed formulas for the Mellin transform…
A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements require the use of projectors,…
Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…
In our last work, we formulate a Fourier transformation on the infinite-dimensional space of functionals. Here we first calculate the Fourier transformation of infinite-dimensional Gaussian distribution $\exp(-\pi…
Recently we have reported a new method of rational approximation of the sinc function obtained by sampling and the Fourier transforms. However, this method requires a trigonometric multiplier that originates from shifting property of the…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
Orthogonal polynomials and the Fourier orthogonal series on a cone of revolution in $\mathbb{R}^{d+1}$ are studied. It is shown that orthogonal polynomials with respect to the weight function $(1-t)^\gamma (t^2-\|x\|^2)^{\mu-\frac12}$ on…
We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…
The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$.…
Three types of numerical data are provided for compact simple Lie groups $G$ of classical types and of any rank. This data is indispensable for Fourier-like expansions of multidimensional digital data into finite series of $E-$functions on…