COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Discrete Analysis Seminar > Primes, Polynomials and Random Matrices

## Primes, Polynomials and Random MatricesAdd to your list(s) Download to your calendar using vCal - Jon Keating, Bristol
- Wednesday 16 January 2013, 16:00-17:00
- MR11, CMS.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Discrete Analysis Seminar
- MR11, CMS
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsYeni Liste Clare Hall Colloquium Cambridge Peace and Education Research Group## Other talksEpigenetic inheritance and parent-of-origin effects Adaptive immunity of wild songbirds; how to handle pathogens and maximize fitness. CafĂ© Synthetique TBC Obesity: from genes to behaviour Prevention is Better than Cure: closing lecture by the Vice Chancellor |