Related papers: Discrete Fourier transform associated with general…

For Poincare series of binary polyhedral groups and Coxeter polynomials there are obtained statements close to the Euclid algorithm and orthogonal polynomials theory: generalized Ebeling formula, decompositions into ramified continued…

We give a simple proof of the sharp decay of the Fourier-transform of surface-carried measures of two-dimensional generic surfaces. The estimates are applied to prove Strichartz and resolvent estimates for elliptic operators whose…

The variance, higher order moments, covariance, and joint moments or cumulants are shown to be special cases of a certain tensor in $V^{\otimes n}$ defined in terms of a collection $X_1,...,X_n$ of $V$-valued random variables, for an…

We provide a power-saving bound for certain smoothed shifted convolution sums for Fourier coefficients of Siegel cusp forms. This result is the first nontrivial estimate for a shifted convolution sum with two cusp forms on a group of higher…

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…

Let $k \geq 2$ be an integer. We prove that factorization of integers into $k$ parts follows the Dirichlet distribution $\text{Dir}\left(\frac{1}{k},\ldots,\frac{1}{k}\right)$ by multidimensional contour integration, thereby generalizing…

Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…

We investigate discretizations of the integrable discrete nonlinear Schr\"odinger dynamical system and related symplectic structures. We develop an effective scheme of invariant reducing the corresponding infinite system of ordinary…

We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier…

The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…

We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of…

We investigate the symmetric Dunkl-classical orthogonal polynomials by using a new approach applied in connection with the Dunkl operator. The main aim of this technique is to determine the recurrence coefficients first and foremost. We…

The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…

We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this…

This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.

In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…

We introduce the Schur class of functions, discrete analytic on the integer lattice in the complex plane. As a special case, we derive the explicit form of discrete analytic Blaschke factors and solve the related basic interpolation…

By a generalized Delsarte polynomial we mean a Laurent polynomial whose exponent vectors are linearly independent. We consider certain monomial deformations of generalized Delsarte polynomials and study their associated differential…

The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…