Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.

Analytic Combinatorics

Introduction Arithmetic functions Elementary theory of prime numbers Characters Summation formulas Classical analytic theory of $L$-functions Elementary sieve methods Bilinear forms and the large sieve Exponential sums The Dirichlet polynomials Zero-density estimates Sums over finite fields Character sums Sums over primes Holomorphic modular forms Spectral theory of automorphic forms Sums of Kloosterman sums Primes in arithmetic progressions The least prime in an arithmetic progression The Goldbach problem The circle method Equidistribution Imaginary quadratic fields Effective bounds for the class number The critical zeros of the Riemann zeta function The spacing of zeros of the Riemann zeta-function Central values of $L$-functions Bibliography Index.

/pdf/analytic-number-theory-3xy3ackp22.pdf

Analytic Number Theory

We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.

PRIMES is in P

We consider asymptotics for orthogonal polynomials with respect to varying exponential weights wn(x)dx = e−nV(x)dx on the line as n ∞. The potentials V are assumed to be real analytic, with sufficient growth at infinity. The principle results concern Plancherel-Rotach-type asymptotics for the orthogonal polynomials down to the axis. Using these asymptotics, we then prove universality for a variety of statistical quantities arising in the theory of random matrix models, some of which have been considered recently in [31] and also in [4]. An additional application concerns the asymptotics of the recurrence coefficients and leading coefficients for the orthonormal polynomials (see also [4]).



The orthogonal polynomial problem is formulated as a Riemann-Hilbert problem following [19, 20]. The Riemann-Hilbert problem is analyzed in turn using the steepest-descent method introduced in [12] and further developed in [11, 13]. A critical role in our method is played by the equilibrium measure dμV for V as analyzed in [8]. © 1999 John Wiley & Sons, Inc.

Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi�s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemeredi�s theorem that any subset of a suficiently pseudorandom set (or measure) of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim, which we reproduce here. Using this, one may place (a large fraction of) the primes inside a pseudorandom set of �almost primes� (or more precisely, a pseudorandom measure concentrated on almost primes) with positive relative density.

https://annals.math.princeton.edu/wp-content/uploads/annals-v167-n2-p03.pdf

The primes contain arbitrarily long arithmetic progressions

The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it our most important tool in the study of prime numbers. This volume studies all aspects of the theory, starting from first principles and probing the function's own challenging theory, with the famous and still unsolved "Riemann hypothesis" at its heart. The second edition has been revised to include descriptions of work done in the last forty years and is updated with many additional references; it will provide stimulating reading for postgraduates and workers in analytic number theory and classical analysis.

The Theory of the Riemann Zeta-Function

Artin's conjecture for primitive roots

Let $C$ be an irreducible projective curve of degree $d$ in $\mathbb{P}^3$, defined over $\overline{\mathbb{Q}}$. It is shown that $C$ has $O_{\varepsilon,d}(B^{2/d+\varepsilon})$ rational points of height at most $B$, for any $\varepsilon>0$, uniformly for all curves $C$. This result extends an estimate of Bombieri and Pila [Duke Math. J., 59 (1989), 337-357] to projective curves.

For a projective surface $S$ in $\mathbb{P}^3$ of degree $d\ge 3$ it is shown that there are $O_{\varepsilon,d}(B^{2+\varepsilon})$ rational points of height at most $B$, of which at most $O_{\varepsilon,d}(B^{52/27+\varepsilon})$ do not lie on a rational line in $S$. For non-singular surfaces one may reduce the exponent to $4/3+16/9d$ (for $d=4$ or 5) or $\max\{1,3/\sqrt{d}+2/(d-1)\}$ (for $d\ge 6$). Even for the surface $x_1^d+x_2^d=x_3^d+x_4^d$ this last result improves on the previous best known.

As a further application it is shown that almost all integers represented by an irreducible binary form $F(x,y)\in\mathbb{Z}[x,y]$ have essentially only one such representation. This extends a result of Hooley [J. Reine Angew. Math., 226 (1967), 30-87] which concerned cubic forms only.

The results are not restricted to projective surfaces, and as an application of other results in the paper it is shown that

$\#\{(x_1,x_2,x_3)\in\mathbb{N}^3:x_1^d+x_2^d+x_3^d=N\}
\ll_{\varepsilon,d} N^{\theta/d+\varepsilon}$

with

$\theta=\frac{2}{\sqrt{d}}+\frac{2}{d-1}.$

When $d\ge 8$ this provides the first non-trivial bound for the number
of representations as a sum of three $d$-th powers.

The density of rational points on curves and surfaces

/pdf/zero-free-regions-for-dirichlet-l-functions-and-the-least-4qczj8tg0n.pdf

Zero-free regions for Dirichlet $L$-functions, and the least prime in an arithmetic progression

where Σ∗ indicates summation over primitive characters only. These last two bounds follow respectively from Theorem 6.2 of Montgomery [6] and from the large sieve in the form due to Gallagher [2], for example. In each case one may interpret the upper bound as being composed of two terms, the first of which reflects the long term average, and the second of which reflects the contribution of a single point where the Dirichlet polynomial is large. Thus for example one has ∫ T

/pdf/a-mean-value-estimate-for-real-character-sums-6edl8pazyt.pdf

D. R. Heath-Brown

Papers

The Theory of the Riemann Zeta-Function

Artin's conjecture for primitive roots

The density of rational points on curves and surfaces

Zero-free regions for Dirichlet $L$-functions, and the least prime in an arithmetic progression

A mean value estimate for real character sums