Electrical networks and hyperplane arrangements

Abstract

This paper introduces Dirichlet arrangements, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize combinatorial results on graphic arrangements to Dirichlet arrangements, addressing characteristic polynomials and supersolvability in particular. We apply these results to visibility sets of order polytopes and fixed-energy harmonic functions on electrical networks.