Computing characteristic polynomials of hyperplane arrangements with symmetries
Combinatorics
2025-05-21 v3
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.
Cite
@article{arxiv.2105.14542,
title = {Computing characteristic polynomials of hyperplane arrangements with symmetries},
author = {Taylor Brysiewicz and Holger Eble and Lukas Kühne},
journal= {arXiv preprint arXiv:2105.14542},
year = {2025}
}
Comments
21 pages, 6 figures, 8 tables, 1 appendix. Updated version based on referee reports