|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 listsCJBS Marketing Group Seminars SCAMPS 09 - One day Symposium Clinical Neuroscience and Mental Health Symposium
Other talksFeminism, Motherhood and Eugenics in pre-WWI Berlin; or: How to promote reform through literary writing? Strong coupling in the far-infrared between graphene plasmons and the surface optical phonons of silicon dioxide (DATE TO BE ARRANGED/CONFIRMED) Predictive Engineering of Cell Fate Protein Misfolding and Cancer: the Tumour Suppressor p53 The Turing trap. How the universal computer is making the internet less secure. Transcriptional networks in the developing Xenopus embryo