hyperplane arrangement algorithm and complexity

asked 2023-06-26 07:10:33 +0100

Wings6796 gravatar image

Hi there, I wonder what kind of the algorithm the hyperplane arrangement algorithm is using and what's the complexity with regarding to the number of hyperplanes. Specifically, the bounded_region method. Suppose we are in d-dimension with n hyperplanes. I check the source code and can only find " This module implements hyperplane arrangements defined over the rationals or over finite fields. The original motivation was to make a companion to Richard Stanley's notes [Sta2007]_ on hyperplane arrangements." Thanks so much for your time and help!

edit retag flag offensive close merge delete


Perhaps it's worth contacting the authors of that module.

Max Alekseyev gravatar imageMax Alekseyev ( 2023-06-30 15:05:52 +0100 )edit