Skip to main content
    • Aa
    • Aa

Lattice points in lattice polytopes

  • Oleg Pikhurko (a1)

It is shown that, for any lattice polytope P⊂ℝd the set int (P)∩lℤd (provided that it is non-empty) contains a point whose coefficient of asymmetry with respect to P is at most 8d · (8l+7)22d+1. If, moreover, P is a simplex, then this bound can be improved to 8 · (8l+7 )2d+1. As an application, new upper bounds on the volume of a lattice polytope are deduced, given its dimension and the number of sublattice points in its interior.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

1. H. Blichfeldt . A new principle in the geometry of numbers with some applications. Trans. Amer. Math. Soc, 15 (1914), 227235.

2. D. Hensley . Lattice vertex polytopes with interior lattice points. Pacific. J. Math, 105 (1983). 183191.

3. J. C. Lagarias and G. M. Ziegler . Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Canad. J. Math., 43 (1991), 10221035.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

  • ISSN: 0025-5793
  • EISSN: 2041-7942
  • URL: /core/journals/mathematika
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 91 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 29th May 2017. This data will be updated every 24 hours.