Cosmin Pohoata, Emory University
Event Date
2025-10-14
Event Time
03:30 pm ~ 04:30 pm
Event Location
Penn (David Rittenhouse Lab 4C8)
For every natural number $n$, if we start with sufficiently many points in $\mathbb{R}^d$ in general position there will always exist n points in convex position. The problem of determining quantitative bounds for this statement is known as the Erdős-Szekeres problem, and is one of the oldest problems in extremal combinatorics (sometimes also called the “Happy Ending Problem”). We will discuss some of its history, some recent developments in the plane and in higher dimensions, as well as some connections with a few other topics in combinatorics and beyond.