- Series
- Number Theory
- Time
- Wednesday, November 13, 2024 - 3:30pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Fernando Xuancheng Shao – University of Kentucky – xuancheng.shao@uky.edu – https://www.ms.uky.edu/~xsh228/
- Organizer
- Alexander Dunn
For a positive integer , define to be the smallest number such that the additive energy of any subset and any is at most . In this talk, I will survey recent results on bounds for , explore the connections with (variants of) the Hausdorff-Young inequality in analysis and with the Balog-Szemeredi-Gowers theorem in additive combinatorics, and then discuss new results on the asymptotic behavior of as .