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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.