Related papers: Sharp Fourier decay estimates for measures support…
We develop a unified approach for establishing rates of decay for the Fourier transform of a wide class of dynamically defined measures. Among the key features of the method is the systematic use of the $L^2$-flattening theorem obtained in…
We generalize a method developed by Sarig to obtain polynomial lower bounds for correlation functions for maps with a countable Markov partition. A consequence is that LS Young's estimates on towers are always optimal. Moreover, we show…
In this paper we establish decay estimates for Fourier transform on Hardy-Morrey spaces and its localizable version. Our work include some aspects to these spaces linked up with pointwise Fourier estimates, in particular a natural approach…
We generalize Bourgain's theorem on the decay of the Fourier transform of the multiplicative convolution of measures on $\mathbb R$ to the ring $\mathbb R^n$, where the multiplication is given by coordinate multiplication.
We introduce a continuous analog of the Fourier ratio for compactly supported Borel measures. For a measure \(\mu\) on \(\mathbb{R}^d\) and \(f\in L^2(\mu)\), the Fourier ratio compares \(L^1\) and \(L^2\) norms of a regularized Fourier…
In this paper we study the general reconstruction of a compactly supported function from its Fourier coefficients using compactly supported shearlet systems. We assume that only finitely many Fourier samples of the function are accessible…
In this paper we characterize the Fourier transformability of a strongly almost periodic measure in terms of an integrability condition for its Fourier Bohr series. We also provide a necessary and sufficient condition for a strongly almost…
We make some observations on the decay rates of the Fourier coefficients of cusp functions.
Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an…
Automatic algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. This paper describes an automatic, adaptive algorithm for approximating the solution to a…
In this paper, we develop a continual analog of decomposition over orthogonal bases in spaces generated by equidistant shifts of a single function. By doing so, we obtain an explicit expression for best approximation by spaces of shifts in…
We show that the Fourier transform of Patterson-Sullivan measures associated to convex cocompact groups of isometries of real hyperbolic space decays polynomially quickly at infinity. The proof is based on the $L^2$-flattening theorem…
We consider the convolution operator for a measure supported on complex curves. The measure which we consider here is an analogue of the affine arclength measure for real curves. By modifying a combinatorial argument called the band…
We prove some weighted Fourier restriction estimates using polynomial partitioning and refined Strichartz estimates. As application we obtain improved spherical average decay rates of the Fourier transform of fractal measures, and therefore…
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 prove sharp estimates on the time-average behavior of the squared absolute value of the Fourier transform of some absolutely continuous measures that may have power-law singularities, in the sense that their Radon-Nikodym derivatives…
For the Fourier transform $\mathcal{F}\mu$ of a general (non-trivial) self-similar measure $\mu$ on the real line $\mathbb{R}$, we prove a large deviation estimate \[ \lim_{c\to +0} \varlimsup_{t\to \infty}\frac{1}{t}\log…
We prove moment inequalities for exponential sums with respect to singular measures, whose Fourier decay matches those of curved hypersurfaces. Our emphasis will be on proving estimates that are sharp with respect to the scale parameter…
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…
An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically…