Related papers: Orbital exponential sums for prehomogeneous vector…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
Let V be a finite dimensional vector space over the field with two elements with a given nondegenerate symplectic form. Let [V] be the vector space of complex valued functions on V and let [V]_Z be the subgroup of [V] consisting of integer…
We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
In this paper, we propose Fourier pseudospectral methods to solve the variable-order space fractional wave equation and develop an accelerated matrix-free approach for its effective implementation. In constant-order cases, our methods can…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
Let $G$ be a reductive group over a local field $F$ and let $\rho:{}^LG \to \mathrm{GL}_{V_{\rho}}(\mathbb{C})$ be a representation of its $L$-group satisfying suitable assumptions. Braverman, Kazhdan and Ng\^o conjectured that one has a…
In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…
The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…
Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…
To study statistical properties of modular forms, including for instance Sato-Tate like problems, it is essential to have a large number of Fourier coefficients. In this article, we exhibit three bases for the space of modular forms of any…
We describe a general framework of functional and Fourier analysis on domains with a free action of an Abelian Lie group $G$. Namely, on a domain of the form $G\times Y$ we introduce the appropriate spaces of distributions and measurable…
By using properties of the Young orthogonal representation, this paper derives a simple form for the Fourier transform of permutations acting on the homogeneous space of $n$-dimensional vectors, and shows that the transform requires $2n-2$…
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…
In an infinitesimal variant of Guo-Jacquet trace formulae, the regular semi-simple terms are expressed as noninvariant weighted orbital integrals on two global infinitesimal symmetric spaces. We prove some relations between the Fourier…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
For each $f\in L^p({\mathbb R)}$ ($1\leq p<\infty$) it is shown that the Fourier transform is the distributional derivative of a H\"older continuous function. For each $p$ a norm is defined so that the space Fourier transforms is…
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…