相关论文: Form factor (Fourier shape transform) of polygon a…

This book is an introduction to the nascent field of Fourier analysis on polytopes, and cones. There is a rapidly growing number of applications of these methods, so it is appropriate to invite students, as well as professionals, to the…

The main goal is to interpret the Askey-Wilson function and the corresponding transform pair on the quantum SU(1,1) group. A weight on the C^*-algebra of continuous functions vanishing at infinity on the quantum SU(1,1) group is studied,…

Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. The simple explicit result exhibits connections between group theory,…

We argue that there should exist a "noncommutative Fourier transform" which should identify functions of noncommutative variables (say, of matrices of indeterminate size) and ordinary functions or measures on the space of paths. Some…

We give a short and "soft" proof of the asymptotic orthogonality of Fourier coefficients of Poincar\'e series for classical modular forms as well as for Siegel cusp forms, in a qualitative form.

We prove non-trivial upper and lower bounds for the "Spectrum of Singularities" of Fourier Series with polynomial frequencies. The Spectrum of Singularities of a function f gives the Hausdorff dimension of the set of points with a given…

In this paper we obtain new sufficient conditions for representation of a function as an absolutely convergent Fourier integral. Unlike those known earlier, these conditions are given in terms of belonging to weighted spaces. Adding weights…

In this paper we show that the discrete Fourier transform can be performed by scattering a coherent particle or laser beam off a two-dimensional potential that has the shape of rings or peaks. After encoding the initial vector into the…

Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…

We propose a technique for performing quantum state tomography of photonic polarization-encoded multi-qubit states. Our method uses a single rotating wave plate, a polarizing beam splitter and two photon-counting detectors per photon mode.…

Consider the Fourier restriction operator associated to a curve in $R^d$, $d\ge 3$. We prove for various classes of curves the endpoint restricted strong type estimate with respect to affine arclength measure on the curve. An essential…

We establish the Fourier inversion for the smooth vectors in ${\rm L}^2({\rm GL}_2, \omega)$ over a number field $\mathbf{F}$, using minimal knowledge from automorphic representation theory. We point out a possible way to establish Fourier…

In this paper, we investigate the "angular changes" behavior of some subfamilies of Fourier coefficients of both integral and half-integral weight holomorphic cusp forms, thus one gets information about signs of the real an imaginary parts…

We explain the orthogonal planes split (OPS) of quaternions based on the arbitrary choice of one or two linearly independent pure unit quaternions $f,g$. Next we systematically generalize the quaternionic Fourier transform (QFT) applied to…

We consider one-parameter families of quadratic-phase integral transforms which generalize the fractional Fourier transform. Under suitable regularity assumptions, we characterize the one-parameter groups formed by such transforms.…

Functions that are smooth but non-periodic on a certain interval possess Fourier series that lack uniform convergence and suffer from the Gibbs phenomenon. However, they can be represented accurately by a Fourier series that is periodic on…

The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…

Using projections on the (generalized) eigenvectors associated to matrices that characterize the topological structure, several authors have constructed generalizations of the Fourier transform on graphs. By exploring mappings of the…

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…

We construct an explicit orthonormal basis of piecewise ${}_{i+1}F_{i}$ hypergeometric polynomials for the Alpert multiresolution analysis. The Fourier transform of each basis function is written in terms of ${}_2F_3$ hypergeometric…