An uncertainty principle for cyclic groups of prime order
Classical Analysis and ODEs
2007-05-23 v6 Number Theory
Abstract
Let be a finite abelian group, and let be a complex function on . The uncertainty principle asserts that the support is related to the support of the Fourier transform by the formula where denotes the cardinality of . In this note we show that when is the cyclic group of prime order , then we may improve this to and show that this is absolutely sharp. As one consequence, we see that a sparse polynomial in consisting of monomials can have at most zeroes. Another consequence is a short proof of the well-known Cauchy-Davenport inequality.
Cite
@article{arxiv.math/0308286,
title = {An uncertainty principle for cyclic groups of prime order},
author = {Terence Tao},
journal= {arXiv preprint arXiv:math/0308286},
year = {2007}
}
Comments
7 pages, no figures, submitted, Math Research Letters. More references added