Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory
arXiv:1701.07330
Abstract
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.