I am currently a member of the Computer Science and Discrete Mathematics group at the Institute for Advanced Study (IAS).

My main research interests are extremal and probabilistic combinatorics.

I received my PhD in mathematics from Stanford University in Spring 2019. My PhD advisor was Jacob Fox. During the academic year 2019/2020, I was a Szegő Assistant Professor at Stanford. Starting in summer 2021, I will be an Assistant Professor at MIT.

My research is supported by NSF Award DMS-1953772.

E-mail: lsauerma [@] mit [dot] edu

- L. Sauermann and Y. Wigderson,
**Polynomials that vanish to high order on most of the hypercube**, submitted. (arxiv) - M. Kwan, L. Sauermann, and Y. Zhao,
**Extension complexity of low-dimensional polytopes**, submitted. (arxiv) - L. Sauermann,
**On the speed of algebraically defined graph classes**, submitted. (arxiv) - J. Fox, M. Kwan, and L. Sauermann,
**Anticoncentration for subgraph counts in random graphs**, submitted. (arxiv) - J. Fox, L. Sauermann, and F. Wei,
**On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices**, submitted. (arxiv) - J. Fox, M. Kwan, and L. Sauermann,
**Combinatorial anti-concentration inequalities, with applications**,*Mathematical Proceedings of the Cambridge Philosophical Society*, to appear. (arxiv) - L. Sauermann,
**On the size of subsets of \mathbb{F}_p^n without p distinct elements summing to zero**,*Israel Journal of Mathematics*, to appear. (arxiv) - M. Kwan and L. Sauermann,
**An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs**,*Discrete Analysis*2020:12, 34 pp. (arxiv) - J. Fox and L. Sauermann,
**A completion of the proof of the Edge-statistics Conjecture**,*Advances in Combinatorics*2020:4, 52 pp. (arxiv) - L. M. Lovász and L. Sauermann,
**A lower bound for the k-multicolored sum-free problem in \mathbb{Z}_m^n**,*Proceedings of the London Mathematical Society*119 (2019), 55-103. (arxiv) - E. Bates and L. Sauermann,
**An upper bound on the size of avoidance couplings**,*Combinatorics, Probability and Computing*28 (2019), 325-334. (arxiv) - L. Sauermann,
**A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k**,*Journal of Combinatorial Theory Series B*134 (2019), 36-75. (arxiv) - J. Fox, L. M. Lovász, and L. Sauermann,
**A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces**,*Journal of Combinatorial Theory Series A*160 (2018), 186-201. (arxiv) - J. Fox and L. Sauermann,
**Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions**,*Electronic Journal of Combinatorics*25 (2018), no. 2, Paper 2.14, 9 pp. (arxiv) - L. Sauermann,
**On the \mu-admissible set in the extended affine Weyl groups of E_6 and E_7**,*Journal of Algebra*451 (2016), 526-543. (arxiv) - C. Reiher and L. Sauermann,
**Nash-Williams' theorem on decomposing graphs into forests**,*Mathematika*60 (2014), 32-36. (arxiv)