The geometry of scheduling
Geometric and topological combinatorics: Modern techniques and methods October 09, 2017 - October 13, 2017
Location: MSRI: Simons Auditorium
By considering a simple form of a scheduling problem, we explore the geometric combinatorics behind a host of polynomial counting functions. Along the way we will encounter Coxeter complexes, quasisymmetric functions, inside out polytopes, Hilbert series, h-vectors and other favorites of the audience
Please report video problems to email@example.com.
See more of our Streaming videos on our main VMath Videos page.