Characteristic Polynomial of Certain Hyperplane Arrangements through Graph Theory

2017/01/25 by Song, Joungmin
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/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.

Related

• Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements J_n
• On the matching arrangement of a graph and properties of its characteristic polynomial
• On certain hyperplane arrangements and colored graphs
• Generalized threshold arrangements
• Computing Characteristic Polynomials of Hyperplane Arrangements with Symmetries