Chromatic Polynomials and the Birthday ProblemAlgebra & Discrete Mathematics
|Speaker:||Persi Diaconis, Stanford|
|Start time:||Fri, Feb 4 2005, 12:10PM|
The chromatic polynomial admits a host of generalizations (Tutte polynomial, Stanly symmetric polynomial). Similarly, the classical birthday problem admits a host of generalizations (multiple matches, unequal probabilities). It turns out these families of generalization are the same, so theorems (and open problems) translate. This is joint work with Geir Helleloyd.