|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 listsIfM Research Capability Development Programme Seminar Series Yundi: Chopin masterclass and 'musical dialogue' Fahad's Michealmas term Talks
Other talksSelf-Control and Weakness of Will Translation machinery in mitochondria – from structure towards clinic Contributed Talk 1: Structure and functions of the bacterial root microbiota in wild and domesticated barley The turbulent tale of Richard Burton, an armchair, and the Hakluyt Society: a story of nineteenth-century geography and the materialities of exploration How and why cells switch off clathrin-mediated endocytosis during mitosis A close look at the master regulators: imaging phytohormones at high-resolution in vivo