A Gr\"obner basis for the graph of the reciprocal plane
Alex Fink, David E Speyer, Alexander Woo

TL;DR
This paper establishes a connection between the Hilbert series of a certain algebraic variety related to hyperplane arrangements and matroid theory, providing a Gr"obner basis proof of their equivalence.
Contribution
It introduces an extended no broken circuit complex for matroids and uses it to prove the equivalence of two Hilbert series expressions via Gr"obner basis methods.
Findings
The Hilbert series expressions from Orlik-Terao and Huh-Katz agree.
A new extended no broken circuit complex is defined for matroids.
A Gr"obner basis argument confirms the equivalence of the two series.
Abstract
Given the complement of a hyperplane arrangement, let be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of in two different-seeming ways, one due to Orlik and Terao and the other to Huh and Katz. We define an extension of the no broken circuit complex of a matroid and use it to give a direct Gr\"obner basis argument that the polynomials extracted from the Hilbert series in these two ways agree.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A Gröbner basis for the graph of the reciprocal plane
Alex Fink
,
David E Speyer
and
Alexander Woo
Abstract.
Given the complement of a hyperplane arrangement, let be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of in two different-seeming ways, one due to Orlik and Terao and the other to Huh and Katz. We define an extension of the no broken circuit complex of a matroid and use it to give a direct Gröbner basis argument that the polynomials extracted from the Hilbert series in these two ways agree.
Let be an arrangement of distinct hyperplanes in an -dimensional vector space over some field . Assume that is essential, that is, that the intersection of all its hyperplanes is . We coordinatize by fixing a linear form vanishing on the th hyperplane. These linear forms provide an injective linear map , and we will identify with its image in from now on. The hyperplane arrangement is then . The arrangement complement is the complement of the coordinate hyperplanes. We can projectivize to form .
Naturally associated to is a matroid of rank represented over on the set of the hyperplanes in , with no loops and no collinear points. The matroid encodes the dependencies among the coordinate functions on : a set of coordinate functions is linearly dependent if and only if is a dependent set of .
An important invariant associated to any matroid, and via this to any hyperplane arrangement, is the characteristic polynomial , defined as
[TABLE]
where the sum is over the flats of the matroid . Here denotes the Möbius function, and is the rank of the flat .
The Cremona transformation is defined by sending to . The reciprocal plane is the closure of the image of the Cremona transformation restricted to , embedded as a closed subvariety of . The reciprocal graph is the closure of the graph of the Cremona transformation restricted to , embedded as a closed subvariety of . Note that , where denotes projection to the second factor.
In previous work, two ways have appeared of recovering the characteristic polynomial from the above geometry. Orlik and Terao [5] show that the Hilbert series of (the projective coordinate ring of) is given by
[TABLE]
where is the coefficient of in ; note that is a polynomial in of degree whose coefficients alternate in sign. In terms of the Grothendieck ring , this means that
[TABLE]
where by we mean
[TABLE]
On the other hand, Huh and Katz [3] show that the cohomology class of in is given by
[TABLE]
where is the coefficient of in the reduced characteristic polynomial . This is a rather surprising coincidence! By the Chern map, the class of a subvariety in can be thought of as the leading terms of its class in . Hence this coincidence between a -class and a cohomology class suggests a correspondence between the leading terms of and all the terms of . Note that this relationship is not simply the one arising from pushforward along the projection, which cannot be computed from only the leading terms of .
Proudfoot and the second author [6] give an explanation of the Orlik–Terao result in terms of combinatorial commutative algebra by showing that has a Gröbner degeneration to the Stanley–Reisner scheme associated to the no broken circuit complex , whose faces are counted by the characteristic polynomial. The no broken circuit complex is a cone over the vertex corresponding to the first variable, so one can define the reduced no broken circuit complex by deleting the cone point. The faces of are counted by the reduced characteristic polynomial. (The authors caution the reader that sources differ as to whether should be called the “no broken circuit complex” or the “broken circuit complex”.)
In this paper, we give a similar combinatorial commutative algebra explanation for the Huh–Katz result by defining a family of extended no broken circuit complexes , one for each total order on , and showing that has Gröbner degenerations to the Stanley–Reisner schemes of . Our simplicial complexes are all pure with one facet for every face of , explaining the common appearance of the (reduced) characteristic polynomial in these two different settings.
By counting the faces of , we also obtain the bigraded Hilbert series for , which is
[TABLE]
The coordinate ring of was recently independently studied by Garrousian, Simis, and Tohaneanu [2]. We recover their results on a presentation for the coordinate ring of . They furthermore show that is arithmetically Cohen–Macaulay. It would be interesting to recover this result by showing that our complexes are shellable.
Acknowledgments
This paper arose from a working group at the Fields Institute thematic semester Combinatorial algebraic geometry, which included Laura Escobar, Federico Galetto, Christian Hasse, Alexandra Seceleanu, and Kristin Shaw. We thank the working group for fruitful discussions, Diane Maclagan and Greg Smith for organizing the thematic semester, and the Fields Institute staff for their hospitality.
The first author was supported by EPSRC grant EP/M01245X/1; the second author was supported by NSF grant DMS-1600223; the third author was supported by Simons Collaboration Grant 359792.
1. The extended no broken circuit complex
Given a matroid of rank on a ground set , a circuit is a minimal dependent set, and a broken circuit is the result of deleting the least element from any circuit in the natural order . The no broken circuit complex is the simplicial complex whose minimal nonfaces are the broken circuits of . In other words, the facets of are the maximal sets not containing a broken circuit. Note that [math] is never in a broken circuit, and hence the vertex [math] is always a cone point of . Following Brylawski [1], we define the reduced no broken circuit complex as the simplicial complex obtained by deleting the vertex [math] from .
It is a classical result, due to Whitney [7] for graphical matroids and Brylawski [1] in general, that the characteristic polynomial of is given by
[TABLE]
where (which is sometimes known as the -th Whitney number of the first kind) is the number of faces of with vertices. Note that the reduced characteristic polynomial satisfies
[TABLE]
where is the number of faces of with vertices.
Given a second partial order on the set , we define the extended no broken circuit complex as follows. The complex has vertices, which we denote . Given any face (including ), let be the basis of containing which is lexicographically maximal with respect to . To be precise, let be the up-set generated by in . Then if or
[TABLE]
Given any , define
[TABLE]
Thus, putting aside which will be a cone point, is the set of subscripts of vertices of , with distinguished within it as the set of subscripts of -variables. The facets of are the sets ; in other words,
[TABLE]
2. Squarefree initial ideals and Stanley–Reisner rings
Let be the bihomogeneous coordinate ring of , and fix a total term order on . Given , is the largest monomial in the support of . Given an ideal , its initial ideal is . Since our term order is a total order, is a monomial ideal. It is a general fact that there exists a flat degeneration from the scheme to preserving the Hilbert series and hence the cohomology class.
Let be a simplicial complex with vertex set . The Stanley–Reisner ideal is the squarefree monomial ideal generated by for all subsets such that . The nonzero monomials of are precisely those whose variables are faces of , so the bigraded Hilbert series with -degree counted by and -degree counted by is given by
[TABLE]
where the sum is over all faces in and and denote respectively the number of -vertices and -vertices in .
Since is squarefree, the subscheme of defined by is reduced, and its irreducible components are the subspaces spanned by as ranges over the maximal faces of . Hence the class of in is
[TABLE]
where the sum is now over all faces of maximal dimension (which in general may not be all maximal faces).
3. Main theorem and proof
Our main theorem is the following.
Theorem 1**.**
Let be the reciprocal graph. Fix a total order on . Let be a term order on such that if while if , and any term that is a multiple of is less than any term of the same degree that is not. Then
- (1)
(Also **[2, Thm. 4.2]**) The defining ideal is generated by the following elements:
- •
* where is a circuit and the define the relation given by the circuit.*
- •
, where is a circuit and are as above.
- •
, for all with 2. (2)
The initial ideal is generated by the following elements:
- •
, where is a broken circuit
- •
, where is any subset of (so not including [math]) and . (Note this includes the degenerate case where .) 3. (3)
The initial ideal is the Stanley–Reisner ideal of the extended no broken circuit complex.
Proof.
Let be the ideal generated by the elements listed in part (1), and let be the ideal generated by the elements of part (2). We will show that and that . We first explain how to conclude the proof using these facts.
Since is pure-dimensional, defines an equidimensional and reduced scheme. Hence if is a monomial ideal containing such that we have the equality
[TABLE]
of cohomology classes (or equivalently of bidgrees), then [4, Exer. 8.13]. By construction, for each face , we have a facet , and every facet has vertices. Furthermore, has -vertices and -vertices. Hence, by Equation (2),
[TABLE]
where the sum is over all faces of .
On the other hand, Huh and Katz [3] show that
[TABLE]
where is the coefficient of in . Since is the number of faces of with vertices, . Taking an initial ideal preserves the cohomology class, so , and . Therefore,
[TABLE]
and .
To show , we show the generators of each type vanish on . The generators involving only the variables come from the relations defining the linear space . On a point in where for all ,
[TABLE]
so
[TABLE]
for all and , and in particular for . Also, given a relation
[TABLE]
on coming from a circuit , we have relations
[TABLE]
or, clearing denominators,
[TABLE]
To show , for each generator of , we find such that . If is a broken circuit, then is some circuit with its first element removed, and hence is the leading term of
[TABLE]
On the other hand, given a subset and some element such that
[TABLE]
either we are in the degenerate case where , where since , or there is some circuit including and a subset of . Let
[TABLE]
be the relation given by . Consider
[TABLE]
We can write
[TABLE]
Note that, if and , then , so
[TABLE]
Since for all ,
[TABLE]
The first term is the leading term, since it contains no and for all , so
[TABLE]
To show , suppose
[TABLE]
Then does not contain a broken circuit, and for every ,
[TABLE]
Note is a face , and by our condition on elements of , so
[TABLE]
Hence,
[TABLE]
4. Hilbert series
In this section, we state and prove our formula for the bigraded Hilbert series of and show how the Orlik–Terao and Huh–Katz results follow from this formula.
Proposition 2**.**
The bigraded Hilbert series of is
[TABLE]
Proof.
Because is an initial degeneration of , it has the same Hilbert function. Computing is an enumerative problem, by (1).
We carry out this count by means of a partition of the faces of . To wit, given any face , let
[TABLE]
The subscripts of the -vertices (not including ) of any facet of make up a face of , so the same is true for any face of . Hence gives a partition of .
Next we show that is in fact the interval , so that if and only if
[TABLE]
Since , we have . Now suppose we have a face . Then for some . However, if , then , where has the meaning it had in Section 1, because if is independent of , then is also independent of . Hence, .
The contribution of to the Hilbert function is
[TABLE]
since for all . The Hilbert function is the sum of these contributions, and there are faces of with , giving
[TABLE]
Since is the second projection of , we may recover by evaluating at 0, corresponding to intersection with the subring of . This evaluation is
[TABLE]
agreeing with the result of Orlik and Terao.
Agreement with the result of Huh and Katz, invoking (2), was used in our proof. Note, though, that this cohomology class can also be calculated directly from the Hilbert series using the method of multidegrees [4, §8.5].
5. Example: Braid arrangement for
We work out the details for the matroid of braid arrangement of , also known as the graphical arrangement for the complete graph . This is a matroid of rank 3 on 6 elements, with characteristic polynomial and reduced characteristic polynomial . Considered as a set of vectors in , we can realize the arrangement as , , , , , and . The circuits of this arrangement are:
[TABLE]
The broken circuits are the sets , , , , , and . (The last three broken circuits contain other broken circuits and hence are non-minimal nonfaces.) The facets of the no broken circuit complex are , , , , , and . The number of facets should be the constant term of the characteristic polynomial, which is correct. The facets of the reduced no broken circuit complex are , , , , , and , and the other faces are the empty set and the five vertices.
Let us take to be the natural order . The facets of the extended no broken circuit complex are
, , , ,
, , , ,
, , , and .
Hence the cohomology class of in is
[TABLE]
The ideal can be presented, with each polynomial written in term order, as
[TABLE]
The initial ideal is given by
[TABLE]
For example, since is dependent on .
The Hilbert series of is given by
[TABLE]
Setting gives
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Thomas Brylawski. The broken-circuit complex. Trans. Amer. Math. Soc. , 234(3):417–433, 1977.
- 2[2] Mehdi Garrousian, Aron Simis, and Stefan O. Tohaneanu. A blowup algebra of hyperplane arrangements. preprint ar Xiv:1701.03470, 2017
- 3[3] June Huh and Eric Katz. Log-concavity of characteristic polynomials and the Bergman fan of matroids. Math. Ann. , 354(3):1103–1116, 2012.
- 4[4] Ezra Miller and Bernd Sturmfels. Combinatorial commutative algebra , volume 227 in Graduate Texts in Mathematics. Springer, New York, 2205.
- 5[5] Peter Orlik and Hiroaki Terao. Arrangements of hyperplanes , volume 300 in Grundlehren der Mathematischen Wissenschaften. Springer Verlag, Berlin, 1992.
- 6[6] Nicholas Proudfoot and David Speyer. A broken circuit ring. Beiträge Algebra Geom. , 47(1):161–166, 2006.
- 7[7] Hassler Whitney. A logical expansion in mathematics. Bull. Amer. Math. Soc. , 38(8):572–579, 1932.
