Related papers: Fourier transforms of polytopes, solid angle sums,…
We provide a rigorous convergence proof demonstrating that the well-known semi-analytical Fourier cosine (COS) formula for the inverse Fourier transform of continuous probability distributions can be extended to discrete probability…
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
A fast Fourier transform method for computing the weight enumerator polynomial and trigonometric degree of lattice rules is introduced.
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…
A Fourier transform S is defined for the quantum double D(G) of a finite group G. Acting on characters of D(G), S and the central ribbon element of D(G) generate a unitary matrix representation of the group SL(2,Z). The characters form a…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
Over the last two decades, several fast, robust, and high-order accurate methods have been developed for solving the Poisson equation in complicated geometry using potential theory. In this approach, rather than discretizing the partial…
We show that the Fourier transform of Patterson-Sullivan measures associated to convex cocompact groups of isometries of real hyperbolic space decays polynomially quickly at infinity. The proof is based on the $L^2$-flattening theorem…
We investigate several infinite product of cosines and find the closed form using the Fourier transform. The answers provide limiting distributions for some elementary probability experiments.
Given a finite subset $F$ of integer points in $\mathbb Z^d$, it is of interest to seek conditions on $F$ that allow it to multi-tile $\mathbb Z^d$ by translations. To this end, we give a discretized version of the Bombieri-Siegel formula,…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…
We introduce topological notions of polytopes and simplexes, the latter being expected to play in p-adically closed fields the role played by real simplexes in the classical results of triangulation of semi-algebraic sets over real closed…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
The integer point transform $\sigma_{\mathcal P}$ is an important invariant of a rational polytope $\mathcal P$, and here we show that it is a complete invariant. We prove that it is only necessary to evaluate $\sigma_{\mathcal P}$ at one…
In analogy with the Poisson summation formula, we identify when the fractional Fourier transform, applied to a Dirac comb in dimension one, gives a discretely supported measure. We describe the resulting series of complex multiples of delta…
A Fourier transform technique is introduced for counting the number of solutions of holomorphic moment map equations over a finite field. This in turn gives information on Betti numbers of holomorphic symplectic quotients. As a consequence…
This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…