Academics

On the Erds-Ginzburg-Ziv Problem in large dimension | Research seminar in Discrete Mathematics

Time:2024-03-26 Tue 17:05-18:15

Venue:ZOOM:787 662 9899 BIMSA

Organizer: Benjamin Sudakov

Speaker:Lisa Sauermann University of Bonn

Abstract

The Erds-Ginzburg-Ziv Problem is a classical extremal problem in discrete geometry. Givenpositive integers m and n, the problem asks about the smallest number s such that among any spoints in the integer lattice Z" one can find m points whose centroid is again a lattice point. Despiteof a lot of attention over the last 50 years, this problem is stil wide open. For fixed dimension nAlon and Dubiner proved that the answer grows linearly with m. In this talk, we discuss bounds forthe opposite case, where the number m is fixed and the dimension n is large. Joint work withDmitrii Zakharov.


Speaker Intro

Lisa Sauermann is a Professor at the University of Bonn. She received her PhD in mathematicsfrom Stanford University in 2019 under the supervision of Jacob Fox. She then held post-doctoralpositions at Stanford University and the Institute for Advanced Study (lAS), and spent two years asan Assistant Professor at Massachusetts Institute of Technology (MlT), before joining the Universityof Bonn in summer 2023, She received the Richard-Rado-Prize in 2020. the European Prize inCombinatorics in 2021, a Sloan Fellowship in 2022, and the von Kaven Award in 2023.

DATEMarch 26, 2024
SHARE
Related News
    • 0

      On rainbow threshold | Research seminar in Discrete Mathematics

      AbstractSolving a problem of Bell, Frieze and Marbach, we extend the recent breakthrough of Frankston,Kahn, Narayanan and Park to the rainbow setting.Speaker IntroJie Han is a professor at the School of Mathematics and Statistics of Beijing Institute ofTechnology. He obtained his Ph.D. degree in 2015 at Georgia State University under thesupervision of Prof. Yi Zhao. He then spent his academic l...

    • 1

      Resolution of the Quadratic Littlewood-Offord problem | Research seminar in Discrete Mathematics

      AbstractConsider a quadratic polynomial $Q(\xi_{1},\dots,\xi_{n})$ of a random binary sequence $\xi_{1},\dots,\xi_{n}$. To what extent can $Q(\xi_{1},\dots,\xi_{n})$ concentrate on a single value? This is a quadratic version of the classical Littlewood-Offord problem; it was was popularised by Costello, Tao and Vu in their study of symmetric random matrices, and has since become a rich source o...