Abstract
AbstractWe 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 implementation, based on , on examples coming from hyperplane arrangements with applications to physics and computer science.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference51 articles.
1. Athanasiadis, Ch.A.: Characteristic polynomials of subspace arrangements and finite fields. Adv. Math. 122(2), 193–233 (1996)
2. Baldi, P., Vershynin, R.: Polynomial threshold functions, hyperplane arrangements, and random tensors. SIAM J. Math. Data Sci. 1(4), 699–729 (2019)
3. Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65–98 (2017)
4. Billera, L.J., Moore, J.T., Moraites, C.D., Wang, Y., Williams, K.: Maximal unbalanced families (2012). arXiv:1209.2309
5. Bremner, D., Dutour Sikirić, M., Pasechnik, D.V., Rehn, Th., Schürmann, A.: Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1), 565–581 (2014)