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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Primes, Polynomials and Random Matrices

Download to your calendar using vCal

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 lists

What is going on in Russia? A Russo-British perspective. Department of Geography (room TBC) Stonehill Room, Margaret Beaufort Institute of Theology, 14 Grange Road

Other talks

Illegal trade in the North Atlantic Christopher Cowie on the epistemology of assessing biosignature claims Title to be confirmed TBC Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity