A Cop and Robber Solve the Kakeya Needle Problem

ACO Seminar
Tuesday, May 22, 2012 - 11:05
1 hour (actually 50 minutes)
Skiles 005
Dartmouth College, Hanover, NH
   We derive optimal strategies for a pursuit-and-evasion game and show that when pitted against each other, the two strategies construct a small set containing unit-length line segments at all angles. Joint work with Y. Babichenko, Y. Peres, R. Peretz, and P. Sousi.