Computing the poset of layers of a toric arrangement

TL;DR

This paper introduces an algorithm to compute the poset of layers, representing the connected components of intersections in a toric arrangement, specifically focusing on the central case.

Contribution

The paper presents a novel algorithm for computing the poset of layers in central toric arrangements, advancing computational methods in this area.

Findings

Algorithm efficiently computes the poset of layers.

Applicable to central toric arrangements in real or complex tori.

Provides a systematic approach for analyzing intersections in toric arrangements.

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.