Computing the poset of layers of a toric arrangement
Combinatorics
2017-08-25 v2
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.
Cite
@article{arxiv.1708.06646,
title = {Computing the poset of layers of a toric arrangement},
author = {Matthias Lenz},
journal= {arXiv preprint arXiv:1708.06646},
year = {2017}
}
Comments
10 pages, 5 figures, minor corrections (a false statement in the introduction was corrected)