Electrical networks and hyperplane arrangements
arXiv:1709.01227 · doi:10.1016/j.aam.2019.07.003
Abstract
This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic arrangements to Dirichlet arrangements, including characteristic polynomials and supersolvability. We apply these results to visibility sets of order polytopes and fixed-energy harmonic functions on electrical networks.
arXiv comment19 pages, 4 figures
References in corpus (6)
- The maximum likelihood degree of a very affine variety
- Lower central series and free resolutions of hyperplane arrangements
- Affine and toric hyperplane arrangements
- On the monodromy action on Milnor fibers of graphic arrangements
- Critical points and resonance of hyperplane arrangements
- Vertex-weighted graphs and freeness of -graphical arrangements