|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 listsJunior Algebra/Logic/Number Theory seminar Visual rhetoric and modern South Asian history (2013) Materials Chemistry Research Interest Group
Other talksSome Studies on Desirable Difficulties The 2015 Vaccine Summit Sonorous Sublimes: Music and Sound 1670–1850 Intense nutrient upwelling and PV mixing in oceanic anti-cyclones caused by submesoscale instabilities Inhibitory activities of short linear motifs underlie Hox interactome specificity in vivo. Antibiotic resistance and antibiotic alternatives: Looking towards the future