BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Is a random polynomial irreducible? - Dimitris Koukoulopoulos (Uni
 versité de Montréal)
DTSTART:20190220T134500Z
DTEND:20190220T144500Z
UID:TALK119350@talks.cam.ac.uk
CONTACT:Aled Walker
DESCRIPTION:Given a "random" polynomial over the integers\, it is expected
  that\, with high probability\, it is irreducible and has a big Galois gro
 up over the rationals. Such results have been long known when the degree i
 s bounded and the coefficients are chosen uniformly at random from some in
 terval\, but the case of bounded coefficients and unbounded degree remaine
 d open. Very recently\, Emmanuel Breuillard and Peter Varju settled the ca
 se of bounded coefficients conditionally on the Riemann Hypothesis for cer
 tain Dedekind zeta functions. In this talk\, I will present unconditional 
 progress towards this problem\, joint with Lior Bary-Soroker and Gady Kozm
 a.
LOCATION:MR11\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR