Computing the poset of layers of a toric arrangement
arXiv:1708.06646
Abstract
A toric arrangement is an arrangement of subtori of codimension one in a real or complex torus. The poset of layers is the set of connected components of non-empty intersections of these subtori, partially ordered by reverse inclusion. In this note we present an algorithm that computes this poset in the central case.
10 pages, 5 figures, minor corrections (a false statement in the introduction was corrected)