Enumerating Chambers of Hyperplane Arrangements with Symmetry
The above picture shows an example of a hyperplane arrangement in the plane consisting of four hyperplanes. The complement consists of ten chambers.
One way of counting these chambers is through a deletion-restriction tree depicted below.
Our paper outlines a novel algorithm to count chambers of hyperplane arrangments taking advantage their symmetry. This yields the following reduced algorithmic structure.
Our chamber counting algorithm is implemented in julia using OSCAR.jl. It can perform this task for arrangements with over a quadrillion chambers. Our implementation is publicly available here: CountingChambers.jl.
The following Jupyter notebooks illustrate how to use our software.
You may also run this file online yourself by clicking the link below.
Project page created: 25/05/2021
Project contributors: Taylor Brysiewicz, Holger Eble, and Lukas Kühne
Corresponding author of this page: Lukas Kühne, firstname.lastname@example.org
Software used: Julia (Version 1.6.0), GAP