An uncertainty principle for arithmetic sequences

Simple item page
dc.creatorGranville, Andrew
dc.creatorSoundararajan, K.
dc.date2004-06-01
dc.date.accessioned2026-07-07T05:08:47Z
dc.date.available2026-07-07T05:08:47Z
dc.descriptionAnalytic 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.
dc.description39 pages
dc.identifierhttps://arxiv.org/abs/math/0406018
dc.identifierhttp://arxiv.org/abs/math/0406018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71401
dc.subjectNumber Theory
dc.subjectClassical Analysis and ODEs
dc.titleAn uncertainty principle for arithmetic sequences
dc.typetext

Files

Collections

arXiv