Boston Lectures, Talks & Symposia

Production art for Richard P. Stanley Seminar in Combinatorics: Hung-Hsun Yu (Princeton University)
New

Now playing · Mon Nov 16 · 3pm

Richard P. Stanley Seminar in Combinatorics: Hung-Hsun Yu (Princeton University)

· · ·

Hung-Hsun Yu of Princeton takes up the distinct distances problem Erdős posed in 1946: what is the least number of distances N points can span? He outlines Guth and Katz's 2010 near-matching bound in the plane, which introduced polynomial partitioning, and the further steps needed to prove a lower bound of N^(2/3−o(1)) in three dimensions, from joint work with Jonathan Tidor and Dmitrii Zakharov.

Details

When
Mon Nov 16, 3pm–4pm
Where
Building 2 143, Cambridge · Cambridge · Map
Presented by
MIT · website
Tickets
Tickets & details at the venue