|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Primes, Polynomials and Random Matrices
If you have a question about this talk, please contact Bob Hough.
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 Goldston and Montgomery. Likewise, we also have much less knowledge of how many primes lie in different arithmetic progressions. This is the subject of a conjecture due to Hooley. I will discuss the analogues of these conjectures for polynomials defined over function fields and outline how they can be proved using the theory of random matrices.
This talk is part of the Discrete Analysis Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsNew Era in Russian Politics: Mayoral Campaign of Alexey Navalny Newnham College Speaker Series Will Handley's Interests
Other talksSingle molecule studies of mRNA localisation and motor activation Kafka and Samza: distributed stream processing in practice Contributed Talk 1: Structure and functions of the bacterial root microbiota in wild and domesticated barley Contractibility of spaces of stability conditions Visiting African Fellows' Research Showcase (in association with Hughes Hall) Chromatin without Histones, Plastid Devolution, and Parasite Invasion Machinery: Diverse Eukaryotes Provide Unexpected Insights into Cell Evolution and Function