Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Convex polytopes from fewer points

Cosmin Pohoata (IAS)

Location:  Hill Center Room 705
Date & time: Monday, 21 November 2022 at 2:00PM - 3:00PM

Abstract: Finding the smallest integer N=ES_d(n) such that in every configuration of N points in R^d in general position there exist n points in convex position is one of the most classical problems in extremal combinatorics, known as the Erd?s-Szekeres problem. In 1935, Erd?s and Szekeres famously conjectured that ES_2(n)=2^{n?2}+1 holds, which was nearly settled by Suk in 2016, who showed that ES_2(n)?2^{n+o(n)}. We discuss a recent proof that ES_d(n)=2^{o(n)} holds for all d?3. Joint work with Dmitrii Zakharov.

Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.