BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Primes\, Polynomials and Random Matrices - Jon Keating\, Bristol
DTSTART:20130116T160000Z
DTEND:20130116T170000Z
UID:TALK39898@talks.cam.ac.uk
CONTACT:Bob Hough
DESCRIPTION:The Prime Number Theorem tells us roughly how many primes lie 
 in a given long interval.  We have much less knowledge of how many primes 
 lie in short intervals\, and this is the subject of a conjecture due to Go
 ldston and Montgomery.  Likewise\, we also have much less knowledge of how
  many primes lie in different arithmetic progressions.  This is the subjec
 t of a conjecture due to Hooley.  I will discuss the analogues of these co
 njectures for polynomials defined over function fields and outline how the
 y can be proved using the theory of random matrices.
LOCATION:MR11\, CMS
END:VEVENT
END:VCALENDAR