Related papers: A Fourier transform for all generalized functions
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…
A proof is given for the Fourier transform for functions in a quantum mechanical Hilbert space on a non-compact manifold in general relativity. In the (configuration space) Newton-Wigner representation we discuss the spectral decomposition…
The quantum Fourier transform (QFT) is sometimes said to be the source of various exponential quantum speed-ups. In this paper we introduce a class of quantum circuits which cannot outperform classical computers even though the QFT…
In this paper, we generalize the Riemann-Liouville differential and integral operators on the space of Henstock-Kurzweil integrable distributions, $D_{HK}$. We obtain new fundamental properties of the fractional derivative and integral, a…
We study very smooth functions on the real line, namely Schwartz functions, that satisfy a finite identity relating their translates and a single modulation. Concretely, we assume there is a nontrivial linear combination of translates of…
This article is the natural continuation of the paper: Mukhammadiev A.~et al Supremum, infimum and hyperlimits of Colombeau generalized numbers in this journal. Since the ring $\tilde{R}$ of Robinson-Colombeau is non-Archimedean, a…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
We first construct a space $\mathcal{W}\left( \mathbb{R}_{\text{c}} ^{n}\right) $ whose elements are test functions defined in $\mathbb{R} _{\text{c}}^{n}=\mathbb{R}^{n}\cup\left\{ \mathbf{\infty}\right\} ,$ the one point compactification…
For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…
In this paper we investigate new results on the theory of superoscillations using time-frequency analysis tools and techniques such as the short-time Fourier transform (STFT) and the Zak transform. We start by studying how the short-time…
Let $A$ be an expansive dilation on $\mathbb{R}^n$, and $p(\cdot):\mathbb{R}^n\rightarrow(0,\,\infty)$ be a variable exponent function satisfying the globally log-H\"{o}lder continuous condition. Let $\mathcal{H}^{p(\cdot)}_A({\mathbb…
We develop a Fourier analysis for a generalization of the class of periodic functions, often referred to as $(\theta, T)$-periodic functions, and prove several properties and inequalities related to the Fourier transform, including a type…
The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in con- junction of the replica method used to study thermodynamics properties of disordered…
The paper presents a new formula for the fractional integration, which generalizes the Riemann-Liouville and Hadamard fractional integrals into a single form, which when a parameter fixed at different values, produces the above integrals as…
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 define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…
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…
We propose a novel definition of Fourier transform, with the property that the transform of a real function is again a real function (without doubling the number of real components). We prove the inversion theorem for the novel definition,…
The main aim of the present work is to arrive at a mathematical theory close to the historically original conception of generalized functions, i.e. set theoretical functions defined on, and with values in, a suitable ring of scalars and…