November 9
Speaker: Alexander Borisov (Binghamton University)
Title: The abc-polynomials
Abstract: If a=b+c is a coprime triple of natural numbers, one can define a polynomial f(x)=bxa−axb+c(x−1)2. The motivation behind this definition is a naive approach to the Masser-Oesterle abc conjecture: attempt to follow the proof in the geometric case by using quantum deformation of integers instead of differentiation of polynomials. I introduced these polynomials in a 1998 paper, and proved some results about them (in particular that most of them are irreducible). Not much happened, until these polynomials unexpectedly reappeared around 2004 in a graduate course problem by Joe Harris, that turned out to be unexpectedly hard. After several months of attempts by Jason Starr, Izzet Coskun and others, it was ultimately solved by Noam Elkies by a short and beautiful argument. A particular case of this problem appeared on 2014 Putnam exam, most probably by Elkies's suggestion, and, unsurprisingly, turned out to be unsolvable “in real time”. While the significance of these polynomials is unclear, I hope to convince you that they are interesting. In particular, I will present the Elkies's beautiful proof.