The HADES seminar on Tuesday, November 26th, will be at 2:00pm in Room 740.

Speaker: Ciprian Demeter (Indiana University Bloomington)

Abstract: Partition the unit square into $N^2$ tiny squares with side length $1/N$. Can a selection of roughly N such tiny squares be made, in such a way that each line intersects at most O(1) of them? Related questions will also be discussed.