the talk will cover some work i’ve done recently on a very interesting question (the size of the largest finite plane besicovitch set) that connects finite geometry, additive combinatorics, and old-fashioned counting. there are a number of nice problems that are wide open, more or less unexamined, and quite accessible.