Abstract

I will talk briefly about three topics I've worked on that fit the theme of this workshop, and what I'd like to work on next. First, I'll talk about the application of tensor rank to classic algorithmic problems such as set cover. Then I'll talk about the group--theoretic approach to prove that \omega = 2 and my attempts to show that it can't succeed. Finally, I'll talk about high-dimensional expanders and their application to proof complexity.