Abstract:
Using the basis of Hermite-Fourier functions (i.e. the quantum oscillator eigenstates) and the Sturm theorem, we derive the practical constraints for a function and its Fourier transform to be both positive. We propose a constructive method based on the algebra of Hermite polynomials. Applications are extended to the 2-dimensional case (i.e. Fourier-Bessel transforms and the algebra of Laguerre polynomials) and to adding constraints on derivatives, such as monotonicity or convexity.

Abstract:
Characterizing in a constructive way the set of real functions whose Fourier transforms are positive appears to be yet an open problem. Some sufficient conditions are known but they are far from being exhaustive. We propose two constructive sets of necessary conditions for positivity of the Fourier transforms and test their ability of constraining the positivity domain. One uses analytic continuation and Jensen inequalities and the other deals with Toeplitz determinants and the Bochner theorem. Applications are discussed, including the extension to the two-dimensional Fourier-Bessel transform and the problem of positive reciprocity, i.e. positive functions with positive transforms.

Abstract:
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 this basis. The mathematics is simple and the transform is fast (faster than the Fast Fourier Transform, which we briefly explain), but approximation by piecewise constants is poor. To improve this first wavelet, we are led to dilation equations and their unusual solutions. Higher-order wavelets are constructed, and it is surprisingly quick to compute with them --- always indirectly and recursively. We comment informally on the contest between these transforms in signal processing, especially for video and image compression (including high-definition television). So far the Fourier Transform --- or its 8 by 8 windowed version, the Discrete Cosine Transform --- is often chosen. But wavelets are already competitive, and they are ahead for fingerprints. We present a sample of this developing theory.

Abstract:
We study the Beurling and Fourier transforms on subspaces of $L^2({\mathbb C})$ defined by an invariance property with respect to the root-of-unity group. This leads to generalizations of these transformations acting unitarily on weighted $L^2$-spaces over $\mathbb C$.

Abstract:
The aim of this paper is to show that, in various situations, the only continuous linear map that transforms a convolution product into a pointwise product is a Fourier transform. We focus on the cyclic groups $\Z/nZ$, the integers $\Z$, the Torus $\T$ and the real line. We also ask a related question for the twisted convolution.

Abstract:
In this work we verify the sufficiency of a Jensen's necessary and sufficient condition for a class of genus 0 or 1 entire functions to have only real zeros. They are Fourier transforms of even, positive, indefinitely differentiable, and very fast decreasing functions. We also apply our result to several important special functions in mathematics to prove that they have only real zeros.

Abstract:
The Fourier transforms of certain Lipschitz functions are discussed and compared with the Hankel transforms of these functions and with their Fourier transforms on the Euclidean Cartan Motion group M(n), n ￠ ‰ ￥2.

Abstract:
Chirps arise in many signal processing applications. While chirps have been extensively studied as functions over both the real line and the integers, less attention has been paid to the study of chirps over finite groups. We study the existence and properties of chirps over finite cyclic groups of integers. In particular, we introduce a new definition of a finite chirp which is slightly more general than those that have been previously used. We explicitly compute the discrete Fourier transforms of these chirps, yielding results that are number-theoretic in nature. As a consequence of these results, we determine the degree to which the elements of certain finite tight frames are well distributed.

Abstract:
We calculate the local Fourier transforms for connections on the formal punctured disk, corroborating the results of J. Fang and C. Sabbah using a different method. Our method is similar to Fang's, but more direct.

Abstract:
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups.