BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sophie Stevens (Johann Radon Institute for Computational and Appli
 ed Mathematics (RICAM)\, Austria)
DTSTART:20200604T150000Z
DTEND:20200604T152500Z
DTSTAMP:20260423T011223Z
UID:CANT2020/47
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/47/
 ">An update on the sum-product problem</a>\nby Sophie Stevens (Johann Rado
 n Institute for Computational and Applied Mathematics (RICAM)\, Austria) a
 s part of Combinatorial and additive number theory (CANT 2021)\n\n\nAbstra
 ct\nIn new work with Misha Rudnev\, we prove a stronger bound on \nthe sum
 -product problem\, showing that \n$\\max(|A+A|\,|AA|)\\geq |A|^{\\frac{4}{
 3}+\\frac{2}{1167}-o(1)}$ for a finite set \n$A\\subseteq \\mathbb{R}$. Th
 is builds upon the work of Solymosi\, Konyagin \nand Shkredov\, although o
 ur paper is self-contained. I will give an overview \nof the arguments\, b
 oth old and new\,  and describe some  consequences \nof the new arguments.
 \n
LOCATION:https://researchseminars.org/talk/CANT2020/47/
END:VEVENT
END:VCALENDAR