- Series
- SIAM Student Seminar
- Time
- Wednesday, October 9, 2013 - 11:00am for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Albert Bush – School of Mathematics, Georgia Tech
- Organizer
- Fabio Difonzo
Erdos and Szemeredi conjectured that if one has a set of n numbers, one must have
either the sumset or product set be of nearly maximal size, cn^2/log(n). In this
talk, he will introduce the sum-product problem in the reals, show previous,
beautiful geometric proofs by Solymosi and Elekes, and discuss some recent progress
by Amirkhanyan, Croot, Pryby and Bush.