|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 listsAvello Publishing Journal 9th Cambridge Immunology Forum - Visions of Immunology Second Language Education Group
Other talksNew Horizons to the Pluto System: Exploring the Frontier of our Solar System Class switch recombination defects Cambridge Public Policy Lecture: Rt Hon Vince Cable, MP The Dollar Shortage in Anglo-American Public Discourse, 1943-1960 Summit diplomacy or top level of the Council? The European Council's role in energy and climate change before and after Lisbon Senate House Tour