The characteristic polynomials of subarrangements of Coxeter arrangements (Q1377879)

In \(R^n\), a subspace arrangement is a finite collection of subspaces. Such an arrangement generates an intersection lattice, and (via the Möbius function of that lattice) a characteristic polynomial. The author uses a method due to Blass and Sagan to determine and study several such polynomials. A familiar subspace arrangement is the coordinate hyperplane arrangement whose members are the hyperplanes \((x_i=0)\) (and whose intersection lattice is \(2^n)\). Embedded in it is the \(k\)-equal subspace arrangement, consisting of all coordinate subspaces of codimensional \(k\). The author gives two equivalent forms for its characteristic polynomial. Other notable examples are the Coxeter arrangement of type \(A\) consisting of hyperplanes of the form \((x_i= x_j)\); the Coxeter arrangement of type \(B\) whose members are the hyperplanes \((x_i=0)\) and \((x_i= \pm x_j)\); and the Coxeter arrangement of type \(D\) whose members have the form \((x_i= \pm x_j)\). There are obvious containments between the Coxeter arrangements. Characteristic polynomials for hyperplane arrangements interpolated between these, and subspace arrangements embedded in them, are given.