, Volume 52, Issue 1-2, pp 25-29

On empty convex polytopes

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Letn andd be integers,n>d ≥ 2. We examine the smallest integerg(n,d) such that any setS of at leastg(n,d) points, in general position in Ed, containsn points which are the vertices of an empty convexd-polytopeP, that is, S∩intP = 0. In particular we show thatg(d+k, d) = d+2k−1 for 1 ≤k ≤ iLd/2rL+1.