Introduction to hyperplane arrangements

A hyperplane arrangement is a finite collection of affine hyperplanes in a (finite dimensional) vector space (over RR say). Given such an arrangement, we discuss how its intersection poset defines the characteristic polynomial of the arrangement. This polynomial has magnificent properties, as it, for example, computes the number of regions of the arrangement. Hyperplane arrangements are the prototypes of matroids, which will be discussed the following week.