University of Cambridge > Talks.cam > Discrete Analysis Seminar > Is a random polynomial irreducible?

  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

Is a random polynomial irreducible?

Download to your calendar using vCal

If you have a question about this talk, please contact Aled Walker .

Given a “random” polynomial over the integers, it is expected that, with high probability, it is irreducible and has a big Galois group over the rationals. Such results have been long known when the degree is bounded and the coefficients are chosen uniformly at random from some interval, but the case of bounded coefficients and unbounded degree remained open. Very recently, Emmanuel Breuillard and Peter Varju settled the case of bounded coefficients conditionally on the Riemann Hypothesis for certain Dedekind zeta functions. In this talk, I will present unconditional progress towards this problem, joint with Lior Bary-Soroker and Gady Kozma.

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

USA Webinar & LT2, Computer Laboratory, William Gates Building. McDonald Institute for Archaeological Research, Downing Site

Other talks

Cambridge AI in Medicine Seminar - April 2026 Title to be confirmed TBC When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? CSAR lecture: Decarbonizing road freight (TBC)
 

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