|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 listsAnnual Disability Lecture Motivic stable homotopy theory study group Cambridge Network Sales & Marketing SIG
Other talksThe 2014 Alcuin Lecture: The UK in or out of the EU: an Italian/European point of view NuSTAR Recapturing pluripotency: links between cellular reprogramming and breast cancer heterogeneity Epigenetics and microRNA Centromere identity and the nature of the chromatin containing the variant histone, CENP-A CodeFirst, Entrepreneur First, and Cambridge University Technology and Enterprise Club