Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-09T15:53:13.297Z Has data issue: false hasContentIssue false
  • English
  • Français

Lattice points in lattice polytopes

Part of: Polytopes and polyhedra

Published online by Cambridge University Press:  26 February 2010

Oleg Pikhurko
Oleg Pikhurko
Affiliation:
DPMMS, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0WB, England. E-mail: O.Pikhurko@dpmms.cam.ac.uk
Get access

Abstract

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.

MSC classification

Secondary: 52B20: Lattice polytopes (including relations with commutative algebra and algebraic geometry)

Information

Type
Research Article
Information
Mathematika , Volume 48 , Issue 1-2 , December 2001 , pp. 15 - 24
Copyright
Copyright © University College London 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Blichfeldt, H.. A new principle in the geometry of numbers with some applications. Trans. Amer. Math. Soc, 15 (1914), 227–235.CrossRefGoogle Scholar
2.Hensley, D.. Lattice vertex polytopes with interior lattice points. Pacific. J. Math, 105 (1983). 183–191.CrossRefGoogle Scholar
3.Lagarias, J. C. and Ziegler, G. M.. Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Canad. J. Math., 43 (1991), 1022–1035.CrossRefGoogle Scholar
4.Lawrence, J.. Finite unions of closed subgroups on the n-dimensional torus. DIM ACS Series Discrete Math. Theoret. Comput. Sci., 4 (1991), 433–441.CrossRefGoogle Scholar
5.Mahler, K.. Ein Übertragungsprinzip für könvexe Korper. Časopis Pĕst. Mat. Fyz., 68 (1939), 93–102.CrossRefGoogle Scholar
6.Pikhurko, O.. Lattice points inside lattice simplices. Preprint math. CO/0008028 at www. arXiv.org (includes the C source code).Google Scholar
7.Scott, P. R.. On convex lattice polygons. Bull. Austral. Math. Soc, 15 (1976), 395–399.CrossRefGoogle Scholar
8.van der Corput, J. G.. Verallgemeinerung einer Mordellschen Beweismethode in der Geometrie der Zahlen. Ada Arithm., 1 (1935), 62–66.Google Scholar
9.Zaks, J., Perles, M. A., and Wills, J. M.. On lattice polytopes having interior lattice points. Elemente Math., 37 (1982), 44–46.Google Scholar