Lisa Sauermann is a PhD candidate in the Department of Mathematics. She works in extremal combinatorics and her research combines techniques from combinatorics, algebra, and probability theory. In her dissertation, Lisa is focusing on polynomial methods in extremal combinatorics. Although polynomials are algebraic objects, in certain settings they can be used to prove combinatorial statements. Lisa is particularly interested in the recent developments originating from a new polynomial method that was introduced by Croot, Lev, and Pach in 2016 and which has since been applied to various combinatorial problems.