Skip to main content
Log in

Enumeration of Lattice 3-Polytopes by Their Number of Lattice Points

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

We develop a procedure for the complete computational enumeration of lattice 3-polytopes of width larger than one, of which there are finitely many for each given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most 11 lattice points (there are 216,453 of them). In order to achieve this we prove that if P is a lattice 3-polytope of width larger than one and with at least seven lattice points then it fits in one of three categories that we call boxed, spiked and merged. Boxed polytopes have at most 11 lattice points; in particular they are finitely many, and we enumerate them completely with computer help. Spiked polytopes are infinitely many but admit a quite precise description (and enumeration). Merged polytopes are computed as a union (merging) of two polytopes of width larger than one and strictly smaller number of lattice points.

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
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Balletti, G., Kasprzyk, A.M.: Three-dimensional lattice polytopes with two interior lattice points. arXiv:1612.08918 (2016)

  2. Beck, M., Nill, B., Reznick, B., Savage, C., Soprunov, I., Xu, Z.: Problem 3 in “Let me tell you my favorite lattice-point problem”. In: Beck, M., et al. (eds.) Integer Points in Polyhedra-Geometry, Number Theory, Representation Theory, Algebra, Optimization, Statistics. Contemporary Mathematics, vol. 452, pp. 179–187. American Mathemtaical Society, Providence (2008)

    Chapter  Google Scholar 

  3. Beckwith, O., Grimm, M., Soprunova, J., Weaver, B.: Minkowski length of 3D lattice polytopes. Discrete Comput. Geom. 48(4), 1137–1158 (2012)

    MathSciNet  MATH  Google Scholar 

  4. Blanco, M., Santos, F.: Lattice 3-polytopes with few lattice points. SIAM J. Discret. Math. 30(2), 669–686 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blanco, M., Santos, F.: Lattice 3-polytopes with six lattice points. SIAM J. Discret. Math. 30(2), 687–717 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Blanco, M., Santos, F.: Sublattice index of lattice 3-polytopes. Preprint in preparation

  7. Bruns, W., Gubeladze, J.: Polytopes, Rings, and K-Theory. Springer Monographs in Mathematics. Springer, Dordrecht (2009)

  8. Bruns, W., Gubeladze, J., Michałek, M.: Quantum jumps of normal polytopes. Discrete Comput. Geom. 56(1), 181–215 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Choi, M.D., Lam, T.Y., Reznick, B.: Lattice polytopes with distinct pair-sums. Discrete Comput. Geom. 27(1), 65–72 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Curcic, M.: Lattice polytopes with distinct pair-sums. PhD Thesis, University of Illinois at Urbana-Champaign (2012). https://www.ideals.illinois.edu/handle/2142/42324

  11. Duong, H.: Minimal volume \(k\)-point lattice \(d\)-simplices. arXiv:0804.2910 (2008)

  12. Kasprzyk, A.M.: Canonical toric Fano threefolds. Can. J. Math. 62(6), 1293–1309 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kasprzyk, A.: Graded ring database. http://www.grdb.co.uk/

  14. Scarf, H.E.: Integral polyhedra in three space. Math. Oper. Res. 10(3), 403–438 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Soprunov, I., Soprunova, J.: Toric surface codes and Minkowski length of polygons. SIAM J. Discrete Math. 23(1), 384–400 (2008/2009)

  16. White, G.K.: Lattice tetrahedra. Can. J. Math. 16, 389–396 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  17. Whitney, J.: A bound on the minimum distance of three dimensional toric codes. PhD Thesis, University of California, Irvine (2010). http://antpac.lib.uci.edu/record=b4509686~S7

  18. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)

Download references

Acknowledgements

The research was supported by grants MTM2011-22792, MTM2014-54207-P (both authors) and BES-2012-058920 (M. Blanco) of the Spanish Ministry of Economy and Competitiveness, and by the Einstein Foundation Berlin (F. Santos). We thank Gabriele Balletti for sharing with us his results ([1], joint work with A. Kasprzyk) on the classification of lattice 3-polytopes with two interior points. In particular, a discrepancy between their results and a preliminary version of ours led us to correct a mistake in a first version of Theorem 3.2 and Corollary 3.3. We thank I. Soprunov and J. Soprunova for pointing us to reference [17]. We thank the anonymous referees of this paper for their thorough revision of it and the constructive comments they made.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mónica Blanco.

Additional information

Editor in Charge: Kenneth Clarkson

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Blanco, M., Santos, F. Enumeration of Lattice 3-Polytopes by Their Number of Lattice Points. Discrete Comput Geom 60, 756–800 (2018). https://doi.org/10.1007/s00454-017-9932-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-017-9932-5

Keywords

Mathematics Subject Classification

Navigation