Hyperplane arrangements in polymake
Combinatorics
2020-03-31 v1 Discrete Mathematics
Abstract
Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm performs significantly better than brute force alternatives, as it requires less convex hulls computations.
Cite
@article{arxiv.2003.13548,
title = {Hyperplane arrangements in polymake},
author = {Lars Kastner and Marta Panizzut},
journal= {arXiv preprint arXiv:2003.13548},
year = {2020}
}
Comments
9 pages, 2 figures, 1 table