SearcharxivSearch

arXiv · 2601.05802

Fourier restriction for the additive Brownian sheet

Abstract

The Fourier restriction problem asks when it is meaningful to restrict the Fourier transform of a function to a given set. Many of the key examples are smooth co-dimension 1 manifolds, although there is increasing interest in fractal sets. Here we propose a natural intermediary problem where one considers the fractal surface generated by the graph of the additive Brownian sheet in $\mathbb{R}^k$. We obtain the first non-trivial estimates in this direction, giving both a sufficient condition on the range of $q\in[1,2]$ for the Fourier transform to be $L^{q}(\mathbb{R}^{k+1})\to L^2(G(W))$ bounded and a necessary condition for it to be $L^{q}(\mathbb{R}^{k+1})\to L^p(G(W))$ bounded. The sufficient condition is obtained via the Fourier spectrum, which is a family of dimensions that interpolate between the Fourier and Hausdorff dimensions. Our main technical result, which is of interest in its own right, gives a precise formula for the Fourier spectrum of the natural measure on the graph of the additive Brownian sheet, and we apply this result to the Fourier restriction problem. Our restriction estimate is stronger than the estimate obtained from the well-known Stein--Tomas restriction theorem for all $k\geq3$. We obtain the necessary condition in two different ways, one via the Fourier spectrum and one via an appropriate Knapp example.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan M. Fraser, Ana E. de Orellana. 2026-01-09. Fourier restriction for the additive Brownian sheet. https://arxiv.org/abs/2601.05802

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR