Two of the most important areas in analytic number theory concern counting the number of zeros of zeta functions on and off the line, and in beating subconvexity bounds. Both types of results can be obtained from knowing moments of the zeta function multiplied by a Dirichlet polynomial. In this talk we present an asymptotic formula for the fourth moment of the zeta function multiplied by a Dirichlet polynomial, and conjecture a formula for general moments.

After a review of older work on this topic, some new results obtained jointly with Soundararajan will be described. These concern higher moments of the error term for the number of primes in a short interval.

I will give a tutorial on methods of testing predictions of random matrix theory on data. There is some nice math (symmetric function theory) and some subtlety (the level repulsions lead to correlated data and need cutting edge tools such as the block bootstrap). This is joint work with Marc Coram.

The strong parallel between conjectural asymptotics of the 2n-th moment of zeta (Conrey, Farmer, Keating, Rubinstein and Snaith) with a ``constant term'' of an Eisenstein series on GL(2n) will be reviewed. For the second moment, the parallel is explained by the Voronoi-Oppenheim summation formula. For larger n, divisor functions of lattices will be defined and a pleasant new Voronoi-type summation formula will be proved for the lattice divisor functions, making use of Bessel functions associated with the Shalika-Kirillov model of a degenerate principal series representation of GL(2n,R).

I will describe numerical and analytical results on cross-correlations between zeros of different L-functions. By analogy with parametric spectral correlations in random matrix theory and in dynamical systems, these cross-correlations can be used to establish the concept of a "distance" in the space of (conjectural) generalised Riemann operators, and to gain some insight into their overall structure.

This talk will be a fairly down-to-earth survey of the theory of elliptic curves, with special emphasis on stating the Birch and Swinnerton-Dyer conjecture and explaining the various invariants that enter into it, and in particular how this turns out to be related to Random Matrix Theory.

M.C. Escher, the graphic artist famous for mathematical patterns and optical illusions, left a blank spot in the middle of his 1956 lithograph, "Print Gallery". Escher signed his name there, instead of completing the center of this picture of curved and whirling buildings. In 2002, a team of mathematicians, computer programmers, and artists used techniques from advanced mathematics to figure out how Escher might have completed the picture. The team was led by Hendrik Lenstra, who will reveal the secrets behind the mysterious blank space during this talk. The presentation and explanation of the mystery will include a number of beautiful images and animations.

Hendrik Lenstra is Professor of Mathematics at the Universiteit Leiden, the Netherlands. Dr Lenstra is a world-renowned mathematician who is known for the clarity and wit of his lectures. His presentation will be aimed at a general audience and should appeal to anyone interested in art, mathematics, or the intersection of the two subjects.

Going against the "folklore" belief that even orthogonal families arise splitting a full orthogonal family by sign, we show that the lone-standing family {L(s,g x Sym2(f)} (where g is a fixed Hecke-Maass form and f varies over holomorphic modular forms of level 1) has SO(even) symmetry. Thus, the theory of symmetry types is not merely about root numbers (sign of the functional equation). The family above is connected with the relation between classical and quantum fluctuations of observables in the modular surface by work of Luo and Sarnak.

For both characteristic polynomials and L-functions, we will consider the relationship between zeros, large values, and zeros of the derivative. We will discuss the maximal order of the zeta-function, and we will describe some unsolved problems in random matrix theory that could illuminate difficult questions in number theory.

In this talk, we shall give results about the asymptotic behavior of roots of random polynomials in the plane. We then specialize to the case of sums of characteristic polynomials of random unitary matrices: we prove an analogue of a result by Bombieri and Hejhal about the zeros on the critical line for linear combination of L-functions.

The characteristic polynomial models of the Riemann zeta function and other L-functions have allowed us to predict answers to a variety of questions previously considered intractable. However, these powerful models have contained no arithmetical information, which generally has to be introduced in an ad hoc manner. I will present a new model for the zeta function developed with C. Hughes and J. Keating that overcomes this difficulty. I will illustrate its use by calculating moments of the Riemann zeta function and estimating the maximal order of the zeta function on the critical line.

Multiple Dirichlet series (L-functions of several complex variables) are Dirichlet series in one complex variable whose coefficients are again Dirichlet series in other complex variables. These series arise naturally in the theory of moments of zeta and L-functions. It was found recently by Diaconu-Goldfeld-Hoffstein that the moment conjectures of random matrix theory, such as the Keating-Snaith conjecture, would follow if certain multiple Dirichlet series had meromorphic continuation to a a particular tube domain.

We shall present an introduction to some of the basic definitions and techniques of this theory as well as a survey of some of the results that have been obtained by this method. These include applications to moments of L-functions, Fermat's last theorem, classification theory via Dynkin diagrams, and analysis of natural constructions as inner products of automorphic forms on GL(n).

This talk will describe the heuristic method of calculating averages of ratios of zeta and L-functions used by Conrey, Farmer and Zirnbauer to generalize conjectures of Farmer. It will include applications of these ratio formulae and a new method devised with Conrey and Forrester will be discussed for calculating the analogous random matrix quantities.

In a paper published in 1992, Selberg introduced an axiomatic class of L-functions (now called the Selberg class S) and raised several very interesting problems. In particular, Selberg raised the problem of classifying the L-functions in S. In this talk we first review the results on the classification problem. Such results depend on the analytic properties of the linear twists of the L-functions. Then we introduce certain non-linear twists and present some recent work (joint with J.Kaczorowski) on their analytic properties and applications.

When the Ramanujan hypothesis about the Dirichlet coefficients of a generic L-function is assumed, it is quite easy to prove upper-bounds of type L(1)<< R^c, for every c>0, where R is a parameter related to the functional equation of L. We show how to prove the same bound when the Ramanujan hypothesis is replaced by a much weaker assumption and L has Euler product of polynomial type. As a consequence, we obtain an upper bound of this type for every cuspidal automorphic GL(n) L-function, unconditionally. We employ these results to obtain Siegel-type lower bounds for twists by Dirichlet characters of the symmetric cube of a Maass form.