The Enumerative Geometry of Hyperplane Arrangements

Abstract

We study enumerative questions on the moduli space M(L) of hyperplane arrangements with a given intersection lattice L. Mn\"ev's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it is even difficult to compute the dimension D = M(L). Embedding M(L) in a product of projective spaces, we study the degree N=deg M(L), which can be interpreted as the number of arrangements in M(L) that pass through D points in general position. For generic arrangements N can be computed combinatorially and this number also appears in the study of the Chow variety of zero dimensional cycles. We compute D and N using Schubert calculus in the case where L is the intersection lattice of the arrangement obtained by taking multiple cones over a generic arrangement. We also calculate the characteristic numbers for families of generic arrangements in P2 with 3 and 4 lines.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…