paper

Phase retrieval from a uniformly discrete point set

arXiv:2609.28341

Abstract

We prove that for every window of the form , where is a polynomial, there exists a uniformly discrete set of points such that the magnitude of the short-time Fourier transform on determines every up to a constant phase factor. The separation distance can be chosen independent of the degree of and proportional to the square root of the dimension. The proof combines a discrete norming inequality, based on a multidimensional Remez inequality and VC-dimension bounds, with tail estimates for the reproducing kernel. A formalization of our main result in Lean 4 is also provided.

arXiv comment14 pages, 1 figure, Lean code available at https://github.com/josefgreilhuber/DiscretePhaseRetrieval