Number/Representation Theory

Event Information Is a random polynomial with bounded coefficients irreducible over the integers?
15:10 on Wednesday March 21, 2018
16:00 on Wednesday March 21, 2018
BA6183, Bahen Center, 40 St. George St.
Lior Bary-Soroker

Tel-Aviv University

It has been known for almost a hundred years that most polynomials with integral coefficients are irreducible and have a big Galois group. For a few dozen of years, people have been interested whether the same holds when one considers sparse families of polynomials — notably, polynomials with plus-minus 1 coefficients. In particular, some guy on the street <http://mathoverflow.net/questions/7969/irreducible-polynomials-with-constrained-coefficients> conjectures that the probability for a random plus-minus 1 coefficient polynomial to be irreducible tends to 1 as the degree tends to infinity (a much earlier conjecture of Odlyzko-Poonen is about the 0-1 coefficients model) . In this talk, I will discuss these types of problems, some approaches to attack them, and I will present some new results toward the conjecture, joint with Gady Kozma.