Computing characteristic polynomials of hyperplane arrangements with symmetries
arXiv:2105.14542 · doi:10.1007/s00454-023-00557-2
Abstract
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its characteristic polynomial. We showcase our julia implementation, based on OSCAR, on examples coming from hyperplane arrangements with applications to physics and computer science.
21 pages, 6 figures, 8 tables, 1 appendix. Updated version based on referee reports