Search arXivSearch

arXiv · 2008.00935

An identity theorem for the Fourier transform of polytopes on rationally parameterisable hypersurfaces

Abstract

A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbolσ(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbolσ: \mathbb{R}^{n-1} \rightarrow \mathbb{R}^n$ is a vector function with domain $D$ and rational functions as components. A generalized $n$-dimensional polytope in $\mathbb{R}^n$ is a union of a finite number of convex $n$-dimensional polytopes in $\mathbb{R}^n$. The Fourier transform of such a generalized polytope $\mathcal{P}$ in $\mathbb{R}^n$ is defined by $F_{\mathcal{P}}(\mathbf{s})=\int_{\mathcal{P}} e^{-i\mathbf{s}\cdot\mathbf{x}} \,\mathbf{dx}$. We prove that $F_{\mathcal{P}_1}(\boldsymbolσ(\mathbf{t})) = F_{\mathcal{P}_2}(\boldsymbolσ(\mathbf{t}))\ \forall \mathbf{t} \in O$ implies $\mathcal{P}_1=\mathcal{P}_2$ if $O$ is an open subset of $D$ satisfying some well-defined conditions. Moreover we show that this theorem can be applied to quadric hypersurfaces that do not contain a line, but at least two points, i.e., in particular to spheres.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konrad Engel. 2020-07-29. An identity theorem for the Fourier transform of polytopes on rationally parameterisable hypersurfaces. https://doi.org/10.1007/s00454-022-00467-9

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

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA