The University of Michigan Student Combinatorics Seminar
Winter 2011
January 31, 4:10-5:00, 3866 East Hall



Graphical hyperplane arrangements and famous (non-graphical) examples

Florian Block

University of Michigan


Abstract

We will continue our discussion on hyperplane arrangements. I plan to focus on the special case of graphical arrangements which can be associated to any graph. In this setting, we recover the chromatic polynomial as a particular instance of the characteristic polynomial of the arrangement. I also plan to discuss certain families of hyperplane arrangements (braid, shi, ...) which frequently show up in "nature".