Projecting Lattice Polytopes Without Interior Lattice Points

References

• Andersen K., Wagner C., Weismantel R. Maximal integral simplices with no interior integer points. (2009) . Technical Report. Preprint, May 16, http://arXiv.org/abs/0904.2108Google Scholar
• Averkov G., Wagner C., Weismantel R. Maximal lattice-free polyhedra: Finiteness and an explicit description in dimension three. Math. Oper. Res. (2010) . ForthcomingGoogle Scholar
• Bárány I., Kantor J.-M. On the number of lattice free polytopes. Eur. J. Combinatorics (2000) 21(1):103–110Crossref, Google Scholar
• Barile M., Bernardi D., Borisov A., Kantor J.-M. On empty lattice simplices in dimension 4. Proc. Amer. Math. Soc. 2010 (2009) . http://argiv.org/abs/12.0912.5310Google Scholar
• Barvinok A. A course in convexity. Graduate Studies in Mathematics (2002) 54(American Mathematical Society, Providence, RI) Google Scholar
• Batyrev V., Nill B. Multiples of lattice polytopes without interior lattice points. Moscow Math. J. (2007) 7:195–207Google Scholar
• Deza M., Onn S. Lattice-free polytopes and their diameter. Discrete Comput. Geometry (1995) 13(1):59–75Crossref, Google Scholar
• Grünbaum B., Kaibel V., Klee V., Ziegler G. M. Convex polytopes. Graduate Texts in Mathematics (2003) 2212nd ed.(Springer-Verlag, New York) . (original ed.: Interscience, London 1967)Google Scholar
• Haase C., Ziegler G. M. On the maximal width of empty lattice simplices. Eur. J. Combin. (2000) 21(1):111–119Crossref, Google Scholar
• Joswig M., Lorenz B., Paffenholz A., Krattenthaler Ch., Strehl V., Kauers M. Polymake and lattice polytopes. Proc. 21st Internat. Conf. Formal Power Ser. Algebraic Combinatorics (FPSAC), Discrete Math. & Theoret. Comput. Sci. (DMTCS) (2009) Nancy, France:491–502Google Scholar
• Kannan R., Lovász L. Covering minima and lattice-point-free convex bodies. Ann. Math. (1988) 128(3):577–602Crossref, Google Scholar
• Kantor J.-M. On the width of lattice-free simplices. Compositio Math. (1999) 118(3):235–241Crossref, Google Scholar
• Lagarias J. C., Ziegler G. M. Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Canadian J. Math. (1991) 43(5):1022–1035Crossref, Google Scholar
• Lovász L., Iri M., Tanabe K. Geometry of numbers and integer programming. Mathematical Programming: Recent Developments and Applications (1989) (Kluwer, Dordrecht) 177–201Google Scholar
• Myrach G. Gitterpunktfreie Gittersimplices. Diplomarbeit (2010) (Technische Universität, Berlin) . (In German)Google Scholar
• Pikhurko O. Lattice points in lattice polytopes. Mathematika (2001) 48(1–2):15–24Crossref, Google Scholar
• Rabinowitz S. A census of convex lattice polygons with at most one interior lattice point. Ars Combinatoria (1989) 28:83–96Google Scholar
• Scarf H. E. Integral polyhedra in three space. Math. Oper. Res. (1985) 10(3):403–438Link, Google Scholar
• Sebő A. An introduction to empty lattice simplices. Proc. 7th Internat. Conf. Integer Programming Combin. Optim., Vol. 1610 (1999) (Springer, Berlin) 400–414Lecture Notes in Computer ScienceCrossref, Google Scholar
• Treutlein J. 3-dimensional lattice polytopes without interior lattice points. (2008) . http://arXiv.org/abs/0809.1787Google Scholar
• Treutlein J. Birationale Eigenschaften generischer Hyperflächen in algebraischen Tori. (2010) . Ph.D. thesis, Universität Tübingen, Tübingen, Germany. http://tobias-lib.uni-tuebingen.de/volltexte/2010/4897Google Scholar
• Ziegler G. M. Lectures on polytopes. Graduate Texts in Mathematics (1995) 1527th ed.(Springer-Verlag, New York) Google Scholar