We now turn to several specific examples of this principle in various contexts. We begin with the more “combinatorial” or “non-ergodic theoretical” instances of this principle, in which there is no underlying probability measure involved; these situations are simpler than the ergodic-theoretic ones, but already illustrate many of the key features of this principle in action.
Sarnak: Equidistribution and Primes - 0 views
Goldston & Yildirim - 0 views
The correspondence principle and finitary ergodic theory « What's new - 0 views
Notes and unpublished papers of Emmanuel Kowalski - 0 views
-
An alternate argument for the arithmetic large sieve inequality September 2008 This short note describes a very natural and well-motivated derivation of the "arithmetic" large sieve inequality from the dual of the analytic inequality, which avoids the usual trick of submultiplicativity of Gallagher. This is also described in a blog post.
E. Kowalski's blog › Modular signs: story of a workaround - 0 views
-
This earlier problem is of considerable importance in algorithmic number theory, and both have been excellent testing and breeding grounds for various important techniques, notably (and this is close to my heart…) leading to the invention and development of the first “large sieve” method by Linnik.
Chance in the Primes - 0 views
1 - 8 of 8
Showing 20▼ items per page