An uncertainty principle for arithmetic sequences
From MaRDI portal
Publication:2642239
Abstract: 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.
Recommendations
Cited in
(13)- Bubbles of congruent primes
- An uncertainty principle for function fields
- Maier’s Matrix Method and Irregularities in the Distribution of Prime Numbers
- Irregularities in the distribution of primes in an arithmetic progression
- Consecutive primes and Beatty sequences
- scientific article; zbMATH DE number 4047825 (Why is no real title available?)
- The variance of integers without small prime factors in short intervals
- Multiplicative functions in short arithmetic progressions
- On the distribution of integers coprime to an integer free of small prime factors
- Different approaches to the distribution of primes
- Small-scale distribution of linear patterns of primes
- Limitations to equidistribution in arithmetic progressions
- Primes in short intervals
This page was built for publication: An uncertainty principle for arithmetic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642239)