Pacific Journal of Mathematics · 1983 · 102 citations · 17 references
Natural SciencesComputer ScienceMathematicsCombinatoricsConvex GeometryLattice Polytopes
Consider a convex polytope with lattice vertices and at least one interior lattice point. We prove that the number of boundary lattice points is bounded above by a function of the dimension and the number of interior lattice points. This extends to arbitrary dimension a result of Scott for the two dimensional case.
17
On Kellogg's Diophantine Problem
D. R. Curtiss · American Mathematical Monthly · 1922 · 48 citations
Eric van Douwen, Jan van Mill · Pacific Journal of Mathematics · 1983 · 41 citations · Full text