Skip to main content
Log in

Markov Bases and Generalized Lawrence Liftings

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a) inside the universal Gröbner basis and (b) inside the Graver basis. We study properties of Markov bases of generalized Lawrence liftings for arbitrary matrices \({A \in \mathcal{M}_{m \times n}(\mathbb{Z})}\) and \({B \in \mathcal{M}_{p \times n}(\mathbb{Z})}\) and show that in cases of interest the complexity of any two Markov bases is the same.

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.

Similar content being viewed by others

References

  1. 4ti2 team: 4ti2—a software package for algebraic, geometric and combinatorial problems on linear spaces. Available at: www.4ti2.de (2007)

  2. Charalambous H., Katsabekis A., Thoma A.: Minimal systems of binomial generators and the indispensable complex of a toric ideal. Proc. Amer. Math. Soc. 135(11), 3443–3451 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Charalambous, H., Thoma, A., Vladoiu, M.: Markov bases of lattice ideals. arXiv:1303.2303v2

  4. Diaconis P., Sturmfels B.: Algebraic algorithms for sampling from conditional distributions. Ann. Statist. 26(1), 363–397 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Drton, M., Sturmfels, B., Sullivant, S.: Lectures on Algebraic Statistics. Oberwolfach Seminars, Vol. 39. Birkhäuser Basel, Basel (2009)

  6. Graver J.E.: On the foundations of linear and integer linear programming I. Math. Program. 9(2), 207–226 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hemmecke R., Nairn K.A.: On the Gröbner complexity of matrices. J. Pure Appl. Algebra 213(8), 1558–1563 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hoşten S., Sullivant S.: A finiteness theorem for Markov bases of hierarchical models. J. Combin. Theory Ser. A 114(2), 311–321 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ohsugi H., Hibi T.: Indispensable binomials of finite graphs. J. Algebra Appl. 4(4), 421–434 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Santos F., Sturmfels B.: Higher Lawrence configurations. J. Combin. Theory Ser. A 103(1), 151–164 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sturmfels B.: Gröbner Bases and Convex Polytopes. University Lecture Series, Vol. 8. AMS, R.I. (1995)

  12. Villarreal R.H.: Rees algebras of edge ideals. Comm. Algebra 23(9), 3513–3524 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Apostolos Thoma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Charalambous, H., Thoma, A. & Vladoiu, M. Markov Bases and Generalized Lawrence Liftings. Ann. Comb. 19, 661–669 (2015). https://doi.org/10.1007/s00026-015-0287-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-015-0287-4

Mathematics Subject Classification

Keywords

Navigation