An uncertainty principle for cyclic groups of prime order
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.