|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 listsMuseum of Zoology Physics of Medicine Roadshow DAMTP Departmental Seminar
Other talksLocally optimal designs for errors-in-variables models “Prescribing safety in a world of multimorbidity and polypharmacy” Physical activity and brain health: are we any closer to give practical advice? Synthesis RIG Graduate Symposium Designs for dose-escalation trials Lunchtime presentation | Language and Literacy in the West Kimberley: The case for 3 and 4 year old Indigenous learners'