Hyperplane Arrangements in polymake

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 fewer convex hulls computations. The implementation is included in polymake since release 4.0.

Introduction

Hyperplane arrangements are ubiquitous objects appearing in different areas of mathematics such as discrete geometry, algebraic combinatorics and algebraic geometry. A common theme is to understand the combinatorics and the topology of the cells in the complement of the arrangement. Combinatorics and its connections to other areas of mathematics are the focus of the software framework polymake [GJ00], hence hyperplane arrangements form an almost mandatory addition to the objects available. We will discuss the implementation, such as the datatypes and properties, as well as some basic algorithms for analyzing hyperplane arrangements.

One of the main advantages of polymake are its various interfaces to other software. This allows keeping the codebase slim, while using powerful software developed by experts from other fields. Still polymake provides basic algorithms for many tasks, in case other software is not available. Hence the idea of the hyperplane arrangements is to provide a datatype with basic functionality as a basis for future interfaces to other software, e.g. to ZRAM [Brü+99] for computing the cell decomposition from the hyperplanes. Nevertheless, the polymake implementation of hyperplane arrangements comes with a basic algorithm for computing the associated cell decomposition that performs significantly better than brute force alternatives. Thus, we will discuss the main ideas of this algorithm in this article as well.

The combinatorics of hyperplane arrangements in real space is linked to zonotopes. Each arrangement endows the support space with a fan structure which is the normal fan of a zonotope. Each hyperplane subdivides the space in two halfspaces. Therefore we can encode relative positions of points with respect to the arrangement. In other words, hyperplane arrangements are examples of (oriented) matroids. Moreover, the hyperplanes in an arrangement can be seen as mirrors hyperplanes of a reflection group.

An interesting application is in Geometric Invariant Theory. GIT constructs quotients of algebraic varieties modulo group actions. The quotients depend on the choice of a linearized ample line bundle. Variation of geometric invariant theory quotients studies how quotients vary when changing the line bundle. Under some hypothesis the classes of equivalent quotients are convex subsets, called chambers. The walls among chambers are defined by certain hyperplane arrangements, see [DH98, Example 3.3.24].

Main Definitions

We begin with the basic definitions in the theory of hyperplane arrangements following our implementation in polymake.

Definition 1

A hyperplane arrangement in is given by the following data:

1. a finite set of linear forms encoding hyperplanes and

2. a polyhedral cone which we call the support cone.

Given a hyperplane arrangement H, the induced fan is a fan with support given by subdividing along all for .

Every hyperplane in the arrangement subdivides the space into two halfspaces

We remark that in the definition we allow duplicate hyperplanes, but from each hyperplane arrangement we can construct a reduced one. Let H be a hyperplane arrangement given by the hyperplanes . The reduced hyperplane arrangement has the same support cone as H and if and only if , for any and any .

To a hyperplane arrangement we associate the polytope

the Minkowski sum of all the line segments and the dual support cone . If , then and is a zonotope.

Remark 1

Often hyperplane arrangements are defined without a support cone, i.e. only for the case . The connection between intersecting is done via taking the Minkowski sum on the dual side. The main ingredient is the fact that

holds for two cones and .

Proposition 2.1

[Zie95, Thm. 7.16] The fan is the normal fan of .

Definition 2

To a maximal cone we associate its signature, which is a set .

Remark 2

In polymake release 4.0 the signature was defined as the set of indices such that . The signature will be automatically updated for data saved in polymake 4.0 and loaded in the subsequent releases.

Example 1

Let H be given by

We will have a look at the induced fans for different support cones . The fan and the polytope are visualized in Fig. 1 for varying .

Fig. 1.

Visualization of and for Example 1

In each of the pictures, the support cone is indicated as the shaded area. The structure of the fan depends heavily on the support cone . In particular, it is possible for hyperplanes to only intersect trivially and thereby becoming irrelevant for . Thus, one may loose information when going from H to .

The labels at the hyperplanes in the first picture indicate which side constitutes , respectively. Using these one can read of the signatures of the single cells, for example the cell generated by the rays (1, 0) and (1, 2) has signature .

Affine Hyperplane Arrangements

An affine hyperplane arrangement is usually given by a finite set of affine hyperplanes:

The whole space is then subdivided along the hyperplanes

resulting in a polyhedral complex .

Analogously to the connection between polytopes and cones, or polyhedral complexes and fans, every affine hyperplane arrangement gives rise to a (projective) hyperplane arrangement by embedding it at height 1:

If we intersect the fan with the affine hyperplane , the resulting polyhedral complex is isomorphic to , via the embedding , .

The support cone allows one to deal with affine hyperplanes computationally. Set

then the maximal cones of are in one-to-one correspondence with the maximal cells of . In particular, polymake can interpret as a polyhedral complex via the embedding mentioned above, and this polyhedral complex will be exactly .

Example 2

As a simple example, choose the following hyperplanes in :

The associated hyperplanes of in are exactly those of the hyperplane arrangement from Example 1. For we choose the cone , then will be at height one.

The induced affine hyperplane arrangement is indicated by the dots and thick line. It is one dimensional and the associated polyhedral complex has four maximal cells.

Example 3

The following is an example of code in polymake.

Implementation

Hyperplane arrangements are implemented in the software polymake as a new object HyperplaneArrangement, which is derived from the already existing object VectorConfiguration. We augment the existing properties of VectorConfiguration with the following properties and methods.

1. HYPERPLANES A matrix encoding the hyperplanes as rows, this is just an override of the property VECTORS of VectorConfiguration

2. SUPPORT A polymake Cone, denoting the support .

3. CELL_DECOMPOSITION A polymake PolyhedralFan, the cell decomposition .

4. CELL_SIGNATURES A , the i-th set in the array contains the indices of hyperplanes evaluating positively on the i-th maximal cone of CELL_DECOMPOSITION.

5. signature_to_cell Given a signature as , get the maximal cone with this signature, if it exists.

6. cell_to_signature Given a cell, a maximal cone of CELL_DECOMPOSITION, determine its signature.

Cell Decomposition Algorithm

Given , we want to compute the subdivision of induced by the hyperplanes, the induced fan . This means, we want to find all the rays and maximal cones of . In terms of the zonotope , this is equivalent to knowing the facets and vertices of , see [Fuk04, GS93]. The facet directions of are the rays of . For very vertex of we get a maximal cone by determining which facets contain it.

The brute force approach is to loop over all possible signatures in and for every signature s to build the cone

For comparing the different algorithms, we count the number of times they have to perform a convex hull computation for converting a signature to a cone. There are signatures, so we have to perform convex hull computations. As we saw in Example 1, it can happen that some hyperplanes are irrelevant, either completely or just for single cells. Furthermore, in Example 1 the fan had at most six maximal cones, however we would have to compute eight intersections with the brute force approach regardless.

Remark 3

This brute force approach is in some ways parallel to the brute force approach for computing the Minkowski sum making up , by taking considering all possible sums of the endpoints of the line segments. One arrives at points whose convex hull is . There are several ways to go on: either attempt a massive convex hull computation directly, or check each point individually whether it is a vertex.

Our approach is to first find a full-dimensional cone of and then to flip hyperplanes in order to compute its neighbors. First take a facet f of , then set

where denotes that and f are parallel. This is the signature of the cell neighboring at facet f, so we can use it to determine the rays of the neighboring cell. Finding the neighbors of a cell allows one to traverse the dual graph of the fan . Taking the support cone into account just requires some minor tweaks, like ignoring facets of that are also facets of . By storing signatures one can avoid recomputation of cones.

To find a starting cone, one selects a generic point x from . A generic point will be contained in a maximal cone, this maximal cone will be

The point x may be contained in some hyperplanes, but these hyperplanes are exactly those that also contain the entire . Using this approach we would do one convex hull computation per maximal cone, arriving at convex hull computations.

Remark 4

As the fan is polytopal, there is a reverse search structure on it, corresponding to the edge graph of the zonotope . This has already been exploited by Sleumer in [Sle99] using the software framework [Brü+99]. Reverse search allows for different kinds of parallelisation and it would be interesting to study the performance of budgeted reverse search [AJ18, AJ16] on this particular problem. Note that the dual problem, finding the vertices of , is equally hard, as it is a Minkowski sum with potentially many summands. We refer the reader to [GS93] for a detailed analysis.

Sample Code

We conclude with a few examples which illustrate the object HyperplaneArrangement and its properties. Example 6 reports the comparison between the running times of the new algorithm implemented in polymake and the brute force algorithm to compute cell decompositions.

Example 4

The following examples compute the cells in the Coxeter arrangement of type A3. The 6 linear hyperplanes in the arrangements are

Now we compute the 36 cells in the Linial arrangement [PS00] given by the 6 affine hyperplanes

As explained in Sect. 2.1, the support cone allows us to deal with affine hyperplanes. We transform the hyperplanes in the projective arrangement with hyperplanes and then we intersect the latter with the support cone (Fig. 2).

Fig. 2.

The arrangement of type A3.

Example 5

This example is based on [Süß19]. Let X be a del Pezzo surface of degree 5 and the class of the canonical divisor. The cone of effective divisors is spanned by ten exceptional curves indexed by and characterized by and . Applying the change of basis , described in [Süß19, Section 3], we see that the polytope P given by points in intersecting with multiplicity coincides with the hypersimplex . In the aforementioned article the author considers the cell decomposition of P induced by the hyperplane arrangement defined by

The decomposition is used to study the toric topology of the Grassmannian of planes in complex 5-dimensional space.

The following code allows one to compute the cell decomposition in polymake. We first compute the new pairing in the new basis .

We then introduce the support cone given by the hypersimplex in the new basis

Finally, we can compute the cell decomposition.

Example 6

Let H be the hyperplane arrangement in given by the hyperplanes normal to -vectors. The number of maximal cones in are known up to , see entry A034997 in the Online Encyclopedia of Integer Sequences. We run polymake implementations of the BFS algorithm described above and the brute force alternative. Our results are reported in Table 1, where we can see that the BFS algorithm performs better than the brute force approach.

Table 1.

Results and runtimes for arrangements in Example 6

d	hyperplanes	rays	maximal cones	Time BFS (s)	Time brute force (s)
2	3	6	6	0.10	0.1
3	7	18	32	0.40	1.2
4	15	90	370	4.98	324.1
5	31	1250	11292	209.19	–
6	63	57750	1066044	40517.84	–