Combinatorics and braid varieties

Abstract

I summarize a framework for finding and proving interesting combinatorial formulas using braid varieties. The combinatorics comes from the Deodhar decomposition of these braid varieties, while the enumeration uses traces in Hecke algebras to compute the number of points in these varieties over finite fields. I give several examples of the success of this framework, and also give many open problems.