13 citations · 53 across the 33 of their papers we have counts for
5 papers · 1 filter
Resolution of the quadratic Littlewood--Offord problem
Matthew Kwan, Lisa Sauermann
Consider a quadratic polynomial of independent Rademacher random variables . To what extent can concentrate on a si…
A Sharp Ramsey Theorem for Ordered Hypergraph Matchings
Lisa Sauermann, Dmitrii Zakharov
We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruciński. Namely, for any and ,…
Essentially tight bounds for rainbow cycles in proper edge-colourings
Noga Alon, Matija Bucić, Lisa Sauermann +2
An edge-coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decad…
On the Erdős--Ginzburg--Ziv Problem in large dimension
Lisa Sauermann, Dmitrii Zakharov
The Erdős--Ginzburg--Ziv Problem is a classical extremal problem in discrete geometry. Given and , the problem asks about the smallest number such that among any poi…
Unit and distinct distances in typical norms
Noga Alon, Matija Bucić, Lisa Sauermann
Erdős' unit distance problem and Erdős' distinct distances problem are among the most classical and well-known open problems in discrete mathematics. They ask for the maximum numbe…