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.