Seminars and Colloquia by Series

Wednesday, November 7, 2018 - 10:14 , Location: Skiles 005 , Kelly Bickel , Bucknell University , Organizer: Shahaf Nitzan
Wednesday, October 31, 2018 - 13:55 , Location: Skiles 006 , Joe Fu , UGA , johogufu@gmail.com , Organizer: Galyna Livshyts
TBA
Wednesday, October 24, 2018 - 13:55 , Location: Skiles 006 , Dmirty Ryabogin , Kent State University , ryabogin@math.kent.edu , Organizer: Galyna Livshyts
TBA
Wednesday, October 17, 2018 - 13:55 , Location: Skiles 005 , Longxiu Huang , Vanderbilt University , Organizer: Shahaf Nitzan
Wednesday, October 10, 2018 - 13:55 , Location: Skiles 005 , Lenka Slavikova , University of Missouri , slavikoval@missouri.edu , Organizer: Michael Lacey
Wednesday, October 3, 2018 - 13:55 , Location: Skiles 005 , Allysa Genschaw , University of Missouri , adcvd3@mail.missouri.edu , Organizer: Michael Lacey
Wednesday, September 19, 2018 - 13:55 , Location: Skiles 005 , Marcin Bownik , University of Oregon , Organizer: Shahaf Nitzan
Wednesday, September 12, 2018 - 13:55 , Location: Skiles 006 , Galyna Livshyts , Georgia Institute of Technology , glivshyts6@math.gatech.edu , Organizer: Galyna Livshyts
Koldobsky showed that for an arbitrary measure on R^n, the measure of the largest section of a symmetric convex body can be estimated from below by 1/sqrt{n}, in with the appropriate scaling. He conjectured that a much better result must hold, however it was recemtly shown by Koldobsky and Klartag that 1/sqrt{n} is best possible, up to a logarithmic error. In this talk we will discuss how to remove the said logarithmic error and obtain the sharp estimate from below for Koldobsky's slicing problem. The method shall be based on a "random rounding" method of discretizing the unit sphere. Further, this method may be effectively applied to estimating the smallest singular value of random matrices under minimal assumptions; a brief outline shall be mentioned (but most of it shall be saved for another talk). This is a joint work with Bo'az Klartag. 
Wednesday, September 5, 2018 - 13:55 , Location: Skiles 006 , Ionel Popescu , Georgia Institute of Technology , Organizer: Galyna Livshyts
TBA
Wednesday, August 29, 2018 - 01:55 , Location: Skiles 154 , Michael Lacey , Georgia Tech , Organizer: Michael Lacey
Spherical averages, in the continuous and discrete setting, are a canonical example of averages over lower dimensional varieties. We demonstrate here a new approach to proving the sparse bounds for these opertators.  This approach is a modification of an old technique of Bourgain. 

Pages