An uncertainty principle for cyclic groups of prime order
Terence Tao
Abstract
Let G be a finite abelian group, and let f: G be a complex function on G. The uncertainty principle asserts that the support (f) := \x ∈ G: f(x) ≠ 0\ is related to the support of the Fourier transform f: G by the formula |(f)| |( f)| ≥ |G| where |X| denotes the cardinality of X. In this note we show that when G is the cyclic group /p of prime order p, then we may improve this to |(f)| + |( f)| ≥ p+1 and show that this is absolutely sharp. As one consequence, we see that a sparse polynomial in /p consisting of k+1 monomials can have at most k zeroes. Another consequence is a short proof of the well-known Cauchy-Davenport inequality.
Create a lesson
Related papers
Characterizing higher-dimensional Hölder domains via spherical geometric functions
Emily Casey, Max Engelstein, Tatiana Toro
The second type of power mean bounds for the hypergeometric mean
Zhen-Hang Yang, Jing-Feng Tian
Spread-out Furstenberg sets II: general configurations and fractal restricted projections
Alex Cohen, Pablo Shmerkin, Hong Wang et al.
Spread-out Furstenberg sets I: the sticky case
Tuomas Orponen, Pablo Shmerkin
Hsiang cubics as spherical Chebyshev polynomials: equioscillation and idempotent quadrature
Vladimir G. Tkachev
Sharp power-weight estimates for the fractional spherical maximal operator
Riju Basak, Surjeet Singh Choudhary, Chun-Yen Shen et al.