Related papers: Fourier transforms of polytopes, solid angle sums,…
Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…
Many stochastic processes are defined on special geometrical objects like spheres and cones. We describe how tools from harmonic analysis, i.e. Fourier analysis on groups, can be used to investigate probability density functions (pdfs) on…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…
We comment on the set of visible points of a lattice and its Fourier transform, thus continuing and generalizing previous work by Schroeder and Mosseri. A closed formula in terms of Dirichlet series is obtained for the Bragg part of the…
This paper is a companion paper to [G4], where sharp estimates are proven for Fourier transforms of compactly supported functions built out of two-dimensional real-analytic functions. The theorems of [G4] are stated in a rather general…
In this paper, we present the general one-dimensional Clifford Fourier Transform. We derive fundamental properties: Plancherel theorem, reconstruction and convolution formulas. Additionally, we provide an application to probability theory…
We use the classical Fourier analysis to introduce analytic families of weighted differential operators on the unit sphere. These operators are polynomial functions of the usual Beltrami-Laplace operator. New inversion formulas are obtained…
We show how the Fourier transform of a shape in any number of dimensions can be simplified using Gauss's law and evaluated explicitly for polygons in two dimensions, polyhedra three dimensions, etc. We also show how this combination of…
Energy evaluation using fast Fourier transforms enables sampling billions of putative complex structures and hence revolutionized rigid protein-protein docking. However, in current methods efficient acceleration is achieved only in either…
We give a construction of a Poisson transform mapping density valued differential forms on generalized flag manifolds to differential forms on the corresponding Riemannian symmetric spaces, which can be described entirely in terms of finite…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
In this paper we consider the fundamental operations dilation and erosion of mathematical morphology. Many powerful image filtering operations are based on their combinations. We establish homomorphism between max-plus semi-ring of integers…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
This paper determines how to define a discretely implemented Fourier transform when analysing an observed spatial point process. To develop this transform we answer four questions; first what is the natural definition of a Fourier…
Three dimensional continuous and discrete Fourier-like transforms, based on the three simple and four semisimple compact Lie groups of rank 3, are presented. For each simple Lie group, there are three families of special functions ($C$-,…
We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…