|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 listsResearch Seminar Series, Faculty of Education, University of Cambridge High dimensional statistics cerf
Other talksRamanujan Graphs and Finite Free Convolutions of Polynomials The functional role of local and large-scale synchronization in human cognition CERF Cavalcade 2015 Investigation of priming effects on associative memory Feeding the world without costing the eart: How can agriculture and biodiversity coexist? Stem cells in lung maintenance and repair