Related papers: Fourier transforms of polytopes, solid angle sums,…
In this work we define a Fourier transform for each $f\in L^{p(\cdot)}(\mathbb{R})$, for a large class of exponent functions $p(\cdot)$, as the distributional derivative of a H\"older continuous function. A norm is defined in the space of…
Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…
When extending the Ehrhart lattice point enumerator $L_P(t)$ to allow real dilation parameters $t$, we lose the invariance under integer translations that exists when $t$ is restricted to be an integer. This paper studies this phenomenon;…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
Let $V_1,V_2,V_3$ be a triple of even dimensional vector spaces over a number field $F$ equipped with nondegenerate quadratic forms $\mathcal{Q}_1,\mathcal{Q}_2,\mathcal{Q}_3$, respectively. Let $Y \subset \prod_{i=1}^3 V_i$ be the closed…
Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…
A new method is presented for solving Poisson's equation inside an open-ended rectangular pipe. The method uses Fast Fourier Transforms (FFTs) to perform mixed convolutions and correlations of the charge density with the Green function.…
This note is a very basic introduction to wavelets. It starts with an orthogonal basis of piecewise constant functions, constructed by dilation and translation. The ``wavelet transform'' maps each $f(x)$ to its coefficients with respect to…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
The paper contains a systematic theory of the one-dimensional Double Hecke algebra, including applications to the difference Fourier transform, Macdonald's polynomials, Gaussian sums at roots of unity, and Verlinde algebras. The main result…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…
We study the Fourier transform of polynomials in an orthogonal family, taken with respect to the orthogonality measure. Mastering the asymptotic properties of these transforms, that we call Fourier--Bessel functions, in the argument, the…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
Using the shift-operator technique, a compact formula for the Fourier transform of a product of two Slater-type orbitals located on different atomic centers is derived. The result is valid for arbitrary quantum numbers and was found to be…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…