|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 listsCambridge Network events Mind-matter Unification Project (TCM Group, Cavendish Laboratory) Logic and Semantics Seminar (Computer Laboratory)
Other talksLocating indigenous knowledge in the Historia Naturalis Brasiliae (1648) Postnatal ontogeny of the cranial base in modern humans and chimpanzees Exploring the Web Frontier Biggest Challenges for Kotlin: Interoperability and Tooling Education for Sustainable Development and Health Education in Times of Reform Respiratory Health and Smoking Science Summit 2016