Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory
Combinatorics
2017-01-27 v2
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.
Cite
@article{arxiv.1701.07330,
title = {Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory},
author = {Joungmin Song},
journal= {arXiv preprint arXiv:1701.07330},
year = {2017}
}