Related papers: Exponentially sparse representations of Fourier in…
We introduce a class of algorithms for constructing Fourier representations of Gaussian processes in $1$ dimension that are valid over ranges of hyperparameter values. The scaling and frequencies of the Fourier basis functions are evaluated…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…
We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of…
Deep neural networks employ specialized architectures for vision, sequential and language tasks, yet this proliferation obscures their underlying commonalities. We introduce a unified matrix-order framework that casts convolutional,…
In this work we derive a simple argument which shows that Gabor systems consisting of odd functions of $d$ variables and symplectic lattices of density $2^d$ cannot constitute a Gabor frame. In the 1--dimensional, separable case, this is a…
Let $\aip(t)$ be the Airy$_2$ process. We show that the random variable [\sup_{t\leq\alpha}\{aip(t)-t^2}+\min{0,\alpha}^2] has the same distribution as the one-point marginal of the Airy$_{2\to1}$ process at time $\alpha$. These marginals…
We consider a class of pseudodifferential operators with a doubly characteristic point, where the quadratic part of the symbol fails to be elliptic but obeys an averaging assumption. Under suitable additional assumptions, semiclassical…
Circular and hyperbolic fractional-order Fourier transformations are actually Weyl pseudo-differential operators. Their associated kernels and symbols are written explicitly. Products of fractional-order Fourier transformations are obtained…
Binary measurements arise naturally in a variety of statistical and engineering applications. They may be inherent to the problem---e.g., in determining the relationship between genetics and the presence or absence of a disease---or they…
We present a Fourier--Galerkin framework for the analysis and computation of subwavelength resonances in two-dimensional scattering problems in finite domains. Starting from the boundary integral formulation, we project the operator onto…
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
The antiperiodic transfer matrix associated to higher spin representations of the rational 6-vertex Yang-Baxter algebra is analyzed by generalizing the approach introduced recently in [1], for the cyclic representations, in [2], for the…
In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…
By using the Efetov's super-symmetric formalism we computed analytically the mean spectral density $\rho(E)$ for the L\'evy and the L\'evy -Rosenzweig-Porter random matrices which off-diagonal elements are strongly non-Gaussian with…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
In the past years, many signal processing operations have been successfully adapted to the graph setting. One elegant and effective approach is to exploit the eigendecomposition of a graph shift operator (GSO), such as the adjacency or…
The task of finding a sparse signal decomposition in an overcomplete dictionary is made more complicated when the signal undergoes an unknown modulation (or convolution in the complementary Fourier domain). Such simultaneous sparse recovery…
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made efficient. Formally, for an $m$-edge undirected graph $G$, we say…
For $\a,\b>0$ and for a locally integrable function (or, more generally, a distribution) $\f$ on $(0,\be)$, we study integral ooperators ${\frak G}^{\a,\b}_\f$ on $L^2(\R_+)$ defined by $\big({\frak G}^{\a,\b}_\f…