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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Primes, Polynomials and Random Matrices

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University International Development (CUID) Introducing the Cambridge Migration Research Forum (CAMMIGRES): An Event for New Graduates Lattice field theory informal seminars

Other talks

Direct measurements of dynamic granular compaction at the mesoscale using synchrotron X-ray radiography Bringing Personality Theory Back to Life: On Persons-in-Context, Idiographic Strategies, and Lazarus Propaganda porcelain: The mirror of the Russian revolution and its consequences Localization and chiral splitting in scattering amplitudes Faster C++ Environmental shocks and demographic consequences in England: 1280-1325 and 1580-1640 compared 'Cambridge University, Past and Present' Structural basis for human mitochondrial DNA replication, repair and antiviral drug toxicity The Digital Doctor: Hope, Hype, and Harm at the Dawn of Medicine’s Computer Age Computing High Resolution Health(care) Networks, resilience and complexity Well-posedness of weakly hyperbolic systems of PDEs in Gevrey regularity.
 

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