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

Is a random polynomial irreducible?

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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