An uncertainty principle for arithmetic sequences
数论
2007-05-23 v1 经典分析与常微分方程
摘要
Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are ``well-distributed'' in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to equi-distribution, as have Fourier analysts when working with the ``uncertainty principle''. In this article we find that these ideas have a natural setting in the analysis of distributions of sequences in analytic number theory, formulating a general principle, and giving several examples.
引用
@article{arxiv.math/0406018,
title = {An uncertainty principle for arithmetic sequences},
author = {Andrew Granville and K. Soundararajan},
journal= {arXiv preprint arXiv:math/0406018},
year = {2007}
}
备注
39 pages