|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 listsAll Biological Anthropology Seminars and Events Beyond Profit Careers Stream SciSoc – Cambridge University Scientific Society
Other talksOK Computer - teaching machines to write music Advances in Proto-Basque Reconstruction and The Proto-Indo-European-Euskarian Hypothesis The Alexander polynomial, its categorification and gluing Mirabilite and salinity dynamics in sea ice brines Local time at zero metric associated to a GFF on a cable graph. Disease dynamics in animal hosts: How natural selection affects disease transmission in insects; and how animal density and climatic factors can influence the prevalence of zoonotic diseases