I am a combinatorialist. I focus on matroid theory, in particular structural and algorithmic aspects of matroids representable over finite fields, as well as their applications to coding theory and graph theory. In the past I have worked on sphere packing and on algorithmic game theory. See my research page and talks page for more details.
- 2012-2015: NSF grant Can we compare sets of points efficiently?
- 2015-2018: NSF grant Connectivity and Structure in Representable Matroids.
My current PhD student is Kevin Grace.
I write for the Matroid Union, a blog for and by the matroid theory community.
Workshops and conferences
- 2014: organizer, with Rudi Pendavingh, of the 2014 International Workshop on Structure in Graphs and Matroids, Princeton.
- 2015: organizer of an invited minisymposium on Matroid Theory at the 2015 Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM).
- 2016: organizer, with Carolyn Chun and Deb Chun, of an invited minisymposium on Matroid Theory at the 2016 SIAM Conference on Discrete Mathematics.
- 2016: organizer, with Rudi Pendavingh, of the 2016 International Workshop on Structure in Graphs and Matroids, Eindhoven.
- 2017: organizer, with Jim Geelen, Peter Nelson, and Luke Postle, of SiGMA: Structure in Graphs, Matroids, Algorithms, Waterloo.
Phone: (225) 578-1588
Office: 224 Lockett Hall