Enumerating Chambers in Hyperplane Arrangements with Symmetry

  • Taylor Brysiewicz (MPI MiS, Leipzig)
E1 05 (Leibniz-Saal)


We introduce a new algorithm for enumerating chambers of a hyperplane arrangement which exploits its underlying symmetry group. Our algorithm counts chambers as a byproduct of computing Betti numbers. We showcase our implementation in OSCAR on examples coming from hyperplane arrangements with applications to physics and computer science.

Mirke Olschewski

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of This Seminar