Skip to main content
Log in

The closure of a linear space in a product of lines

  • Published:
Journal of Algebraic Combinatorics Aims and scope Submit manuscript

Abstract

Given a linear space L in affine space \({\mathbb {A}}^n\), we study its closure \(\widetilde{L}\) in the product of projective lines \(({\mathbb {P}}^1)^n\). We show that the degree, multigraded Betti numbers, defining equations, and universal Gröbner basis of its defining ideal \(I(\widetilde{L})\) are all combinatorially determined by the matroid M of L. We also prove that \(I(\widetilde{L})\) and all of its initial ideals are Cohen–Macaulay with the same Betti numbers, and can be used to compute the h-vector of M. This variety \(\widetilde{L}\) also gives rise to two new objects with interesting properties: the cocircuit polytope and the external activity complex of a matroid.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Sometimes the dual choice is made: One may also associate with L the dual matroid of rank d, whose bases are the d-subsets \(S \subset [n]\) such that \(H_S\) contains \(\pi (L)\). These two choices are equivalent, and we have chosen the one that is more convenient for us.

  2. Different conventions are used by different authors, and sometimes the names of these two polynomials are reversed. We follow [6].

  3. Sometimes the dual convention is chosen, and the matroid of L is defined to be the dual matroid \(M(L)^*\).

  4. When the choice of the order \(<\) is clear, we will omit the subscript and write simply EA(B) and EP(B).

  5. It is more common to demand that \(\sum _{x \le z \le y} \mu (x,z) = 0\) for all \(x<y\); these two conditions are equivalent.

  6. We reverse it because the initial term \({{\mathrm{in}}}_<f\) is the largest monomial of f, while basis activities are usually defined in terms of the smallest elements of circuits and cocircuits.

References

  1. Aguiar, M., Ardila, F.: The Hopf monoid of generalized permutahedra. preprint (2011)

  2. Ardila, F., Benedetti, C., Doker, J.: Matroid polytopes and their volumes. Discrete Comput. Geom. 43(4), 841–854 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ardila, F.: Semimatroids and their Tutte polynomials. Revis. Colomb. de Matemáticas 41, 39–66 (2007)

    MATH  MathSciNet  Google Scholar 

  4. Aholt, C., Sturmfels, B., Thomas, R.: A Hilbert scheme in computer vision. Can. J. Math. 65(5), 961–988 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Boocher, A., Brown, B. C., Duff, T., Lyman, L., Murayama, T., Nesky, A., Schaefer, K.: Robust Graph Ideals. arXiv preprint arXiv:1309.7630 (2013)

  6. Björner, A.: The homology and shellability of matroids and geometric lattices. Matroid Appl. 40, 226–283 (1992)

    Article  Google Scholar 

  7. Boocher, A.: Free resolutions and sparse determinantal ideals. Math. Res. Lett. 19(4), 805–821 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boocher, A., Robeva, E.: Robust Toric Ideals. arXiv:1304.0603

  9. Brylawski, T.: A combinatorial model for series-parallel networks. Trans. Am. Math. Soc. 154, 1–22 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  10. Blok, R.J., Sagan, B.E.: Topological properties of activity orders for matroid bases. J. Combin. Theory Ser. B 94(1), 101–116 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Conca, A., Hoşten, S., Thomas, R. R.: Nice initial complexes of some classical ideals, Algebraic and geometric combinatorics. Contemp. Math. vol. 423, Am. Math. Soc., Providence, RI, (2006) pp. 11–42

  12. Conca, A., De Negri, E., Gorla, E.: Universal Groebner bases for maximal minors. arXiv:1302.4461 (2013)

  13. Crapo, H.: The Tutte polynomial. Aequationes Mathematicae 3(3), 211–229 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  14. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Junger M., Reinelt G., Rinaldi G. (Eds). Combinatorial Optimization, Lecture Notes in Computer Science, vol. 2570, Springer Berlin, (2003), pp. 11–26 (English)

  15. Eisenbud, D.: Commutative algebra, Graduate Texts in Mathematics, vol. 150. Springer, New York (1995). With a view toward algebraic geometry

    Google Scholar 

  16. Gelfand, I.M., Goresky, R.M., MacPherson, R.D., Serganova, V.V.: Combinatorial geometries, convex polyhedra, and schubert cells. Adv. Math. 63(3), 301–316 (1987)

    Article  MathSciNet  Google Scholar 

  17. Herzog, J., Hibi, T.: Monomial Ideals, Graduate Texts in Mathematics, vol. 260. Springer, London (2011)

    Book  Google Scholar 

  18. Jensen, A.N.: Gfan, A Software System for Gröbner Fans and Tropical Varieties. http://home.imf.au.dk/jensen/software/gfan/gfan.html

  19. Knutson, A., Miller, E.: Gröbner geometry of Schubert polynomials. Ann. Math. 161(3), 1245–1318 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kozen, D.: The Design and Analysis of Algorithms. Springer, New York (1991)

    MATH  Google Scholar 

  21. Kung, J.P.S.: Strong Maps. Encyclopedia of Mathematics, vol. 26, pp. 224–253. Cambridge University Press, Cambridge (1986)

    Google Scholar 

  22. Li, B.: Images of Rational Maps of Projective Spaces. arXiv:1310.8453

  23. Las Vergnas, Michel: On the Tutte Polynomial of a Morphism of Matroids. Ann. Discrete Math. 8, 7–20 (1980), Combinatorics 79 (Proc. Colloq., Univ. Montréal, Montreal, Que., 1979), Part I

  24. Las Vergnas, M.: Active orders for matroid bases. Eur. J. Comb. 22, 709–721 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  25. Morton, J., Pachter, L., Shiu, A., Sturmfels, B., Wienand, O.: Convex rank tests and semigraphoids. SIAM J. Discrete Math. 23(3), 1117–1134 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  26. Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra, Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)

    Google Scholar 

  27. Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)

    MATH  Google Scholar 

  28. Peeva, I.: Graded Syzygies, Algebra and Applications, vol. 14. Springer, London (2011)

    Book  Google Scholar 

  29. Postnikov, A.: Permutohedra, associahedra, and beyond. Int. Math. Res. Notices 6, 1026–1106 (2009)

    MathSciNet  Google Scholar 

  30. Postnikov, A., Reiner, V., Williams, L.: Faces of generalized permutohedra. Doc. Math. J. DMV 13, 207–273 (2008)

    MATH  MathSciNet  Google Scholar 

  31. Proudfoot, N., Speyer, D.: A broken circuit ring. Beit. Algebra Geom. 47(1), 161–166 (2006)

    MATH  MathSciNet  Google Scholar 

  32. Petrović, S., Thoma, A., Vladoiu, M.: Bouquet Algebra of Toric Ideals. arXiv preprint arXiv:1507.02740 (2015)

  33. Schrijver, A.: Combinatorial Optimization—Polyhedra and Efficiency. Springer, New York (2003)

    MATH  Google Scholar 

  34. Sturmfels, B.: Gröbner Bases and Convex Polytopes, University Lecture Series, vol. 8. American Mathematical Society, Providence (1996)

    Google Scholar 

  35. Sturmfels, B., Zelevinsky, A.: Maximal minors and their leading terms. Adv. Math. 98(1), 65–112 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  36. Tatakis, C.: Generalized Robust Toric Ideals. arXiv preprint arXiv:1503.00367 (2015)

  37. Tutte, W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80–91 (1954)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We would like to thank Lauren Williams for organizing an open problem session at UC Berkeley in the Spring of 2013, where this joint project was born. The first author would also like to thank Lauren and UC Berkeley for their hospitality during the academic year 2012–2013, when part of this work was carried out. This was done while the second author was a PhD thesis student and he is grateful to David Eisenbud, Binglin Li, and Bernd Sturmfels for helpful conversations concerning this project. Finally we thank the referees for their suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adam Boocher.

Additional information

Ardila was partially supported by the US National Science Foundation CAREER Award DMS-0956178 and the SFSU-Colombia Combinatorics Initiative. Boocher was partially supported by an NSF Graduate Research Fellowship.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ardila, F., Boocher, A. The closure of a linear space in a product of lines. J Algebr Comb 43, 199–235 (2016). https://doi.org/10.1007/s10801-015-0634-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10801-015-0634-x

Keywords

Navigation