Related papers: Fourier transforms of polytopes, solid angle sums,…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This paper is devoted to the $L^p(\mathbb R)$ theory of the fractional Fourier transform (FRFT) for $1\le p < 2$. In view of the special structure of the FRFT, we study FRFT properties of $L^1$ functions, via the introduction of a suitable…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
We present a formula for the degree of the discriminant of a smooth projective toric variety associated to a lattice polytope P, in terms of the number of integral points in the interior of dilates of faces of dimension greater or equal…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
A new application of polytope theory to Lie theory is presented. Exponential sums of convex lattice polytopes are applied to the characters of irreducible representations of simple Lie algebras. The Brion formula is used to write a polytope…
For certain types of statistical models, the characteristic function (Fourier transform) is available in closed form, whereas the probability density function has an intractable form, typically as an infinite sum of probability weighted…
We consider a large class of physical fields $u$ written as double inverse Fourier transforms of some functions $F$ of two complex variables. Such integrals occur very often in practice, especially in diffraction theory. Our aim is to…
Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…
We introduce some new higher dimensional generalizations of the Dedekind sums associated with the Bernoulli functions and of those Hardy sums which are defined by the sawtooth function. We generalize a variant of Parseval's formula for the…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
We present a general approach for evaluating a large variety of three-dimensional Fourier transforms. The transforms considered include the useful cases of the Coulomb and dipole potentials, and include situations where the transforms are…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
The Forster transform is a method of regularizing a dataset by placing it in {\em radial isotropic position} while maintaining some of its essential properties. Forster transforms have played a key role in a diverse range of settings…
A two-dimensional Fourier transform of hadron form factors allows to determine their charge density in transverse space. We show that this method can be applied to any virtual photon induced transition, such as \gamma *(q)+N -> \pi N. Only…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
Ten types of discrete Fourier transforms of Weyl orbit functions are developed. Generalizing one-dimensional cosine, sine and exponential, each type of the Weyl orbit function represents an exponential symmetrized with respect to a subgroup…
Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…
In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…