Related papers: Levels of distribution for sieve problems in preho…
Let $D$ be a definite quaternion algebra over $\mathbb{Q}$ and $\mathcal{O}$ an Eichler order in $D$ of square-free level. We study distribution of the toric periods of algebraic modular forms of level $\mathcal{O}$. We focus on two…
The knowledge of the exact structure of the optical system PSF enables a high-quality image reconstruction in fluorescence microscopy. Accurate PSF models account for the vector nature of light and the phase and amplitude modifications.…
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…
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…
In this paper we study how zeros of the Fourier transform of a function $f: \mathbb{Z}_p^d \to \mathbb{C}$ are related to the structure of the function itself. In particular, we introduce a notion of bandwidth of such functions and discuss…
We highlight the important role of the Fourier transform in deriving inversion formulas for the integral transforms of tomographic imaging. We demonstrate this principle by deriving inversion formulas for the divergent beam transform and…
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is…
We consider an ``enhanced symmetric space'', which is a prehomogeneous vector space. This vector space is intimately related to a double flag variety studied in \cite{NO.2018}. On a distinguished open orbit called ``enhanced positive…
In this paper, we propose a numerical method of Fourier transform based on hyperfunction theory. In the proposed method, we compute analytic functions called the defining functions, which give the desired Fourier transform as a…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
We extend the Gelfand and Graev construction of generalized Fourier transforms on basic affine space from split groups to quasi-split groups over a local non-archimedean field $F$.
We develop geometry-of-numbers methods to count orbits in prehomogeneous vector spaces having bounded invariants over any global field. As our primary example, we apply these techniques to determine, for any base global field $F$, the…
In view of recently demonstrated joint use of novel Fourier-transform techniques and effective high-accuracy frequency domain solvers related to the Method of Moments, it is argued that a set of transformative innovations could be developed…
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…
The unified transform method introduced by Fokas can be used to analyze initial-boundary value problems for integrable evolution equations. The method involves several steps, including the definition of spectral functions via nonlinear…
Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a…
Many applications of machine learning on discrete domains, such as learning preference functions in recommender systems or auctions, can be reduced to estimating a set function that is sparse in the Fourier domain. In this work, we present…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
We reconstruct the velocity field of incompressible flows given a finite set of measurements. For the spatial approximation, we introduce the Sparse Fourier divergence-free (SFdf) approximation based on a discrete $L^2$ projection. Within…
Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then use this result together with Fourier techniques to…