Refined additive uncertainty principle

Abstract

Signal recovery from incomplete or partial frequency information is a fundamental problem in harmonic analysis and applied mathematics, with wide-ranging applications in communications, imaging, and data science. Historically, the classical uncertainty principles, such as those by Donoho and Stark, have provided essential bounds relating the sparsity of a signal and its Fourier transform, ensuring unique recovery under certain support size constraints. Recent advances have incorporated additive combinatorial notions, notably additive energy, to refine these uncertainty principles and capture deeper structural properties of signal supports. Building upon this line of work, we present a strengthened additive energy uncertainty principle for functions $f:\mathbb{Z}_N^d\to\mathbb{C}$, introducing explicit correction terms that measure how far the supports are from highly structured extremal sets like subgroup cosets. We have two main results. Our first theorem introduces a correction term which strictly improves the additive energy uncertainty principle from Aldahleh et al., provided that the classical uncertainty principle is not satisfied with equality. Our second theorem uses the improvement to obtain a better recovery condition. These theorems deliver strictly improved bounds over prior results whenever the product of the support sizes differs from the ambient dimension, offering a more nuanced understanding of the interplay between additive structure and Fourier sparsity. Importantly, we leverage these improvements to establish sharper sufficient conditions for unique and exact recovery of signals from partially observed frequencies, explicitly quantifying the role of additive energy in recoverability.