|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 listsLinguistics PhD seminars History of science for mathmos Introduction to Fractional Calculus
Other talksDissident Voices in Theorising Europe: Another Theory is Possible Festival of Ideas and Curating Cambridge Launch The Iconography of Alterity: Simla and the Visualisation of ‘British’ Enclaves in Indian Highlands THE DRILLERS DON’T LIKE GETTING WET or WHY THE LAUNDRY ROOM KEEPS GETTING FLOODED : Water up to surprisingly high levels around the legs of large floating oil rigs “Breaking the Triple Coincidence in International Finance” Nutrition and cancer: prevention, management and policy