|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 listsEntrepreneurship for a Zero Carbon Society Is there Enough for All of Us? Global Growth, Climate Change and Food Security Resistance in Russia and Eastern Europe
Other talksThe Mechanical Arts in Twelfth Century School Poetry Inherent Inconsistency of EU Energy Policymaking The 2017 Sports Science Summit Carving Romanesque Chiaroscuro The Whittle Laboratory: Fluid mechanics of jet engines and vacuum cleaners High strain rate deformation response of titanium for aerospace gas turbines