Louis Billera

For some time, my research has centered on combinatorial properties of convex polytopes and, more generally, to algebraic approaches to combinatorial problems arising in geometry.  Some questions are related to the facial structure of polytopes, for example, the enumeration of faces by dimension.  Others have to do with subdivisions of polytopes.

A common theme in much of this has been the construction of polytopes to given specifications:  for example the construction with Carl Lee of polytopes satisfying the conditions of McMullen’s g-conjecture, showing these conditions to be sufficient to describe the enumeration of faces of all simplicial convex polytopes, or the construction with Bernd Sturmfels of fiber polytopes, showing that certain sets of polyhedral subdivisions of polytopes themselves have the structure of convex polytopes.  In addition, we have used some of these ideas in the study of questions arising in biology concerning the structure of the space of all phylogenetic trees.

More recently, I have been studying algebraic structures underlying the enumeration of faces and flags in polytopes and posets.  This has led to the study of connections with the theory quasisymmetric and symmetric functions and has had application to enumeration in matroids and hyperplane arrangements and to a represention of the Kazhdan-Lusztig polynomials of Bruhat intervals in a Coxeter group.