On empty convex polytopes
type: Item
instance of: scholarly article
title: On empty convex polytopes
zbMATH Open document ID: 0818.52008
DOI: 10.1007/BF01406823
author: Heiko Harborth
author: T. Bisztriczky
published in: Journal of Geometry
publication date: 1995-03-30T00:00:00Z
review text: For integers \(n\) and \(d\), with \(n > d \geq 2\), the authors examine the smallest integer \(g(n,d)\) such that any set \(S\) of at least \(g(n,d)\) points in general position in \(E^ d\) contains \(n\) points which are the vertices of an empty convex \(d\)-polytope \(P\) (i.e., \(S \cap \text{int} P = \varphi)\). Among other results, they show that if \(g(d + k, d)\) exists, then \(g(d + k,d) \geq d + 2k - 1\) for \(k \geq 1\), i.e. (together with a result of the first named author and V. Soltan) \(g(d + k,d) = d + 2k - 1\) for \(1 \leq k \leq \lfloor {d \over 2} \rfloor + 1\). In this context, the smallest number \(q = q_ t (d)\) of points in \(E^ d\) is determined such that all subsets of size \(q-t\) have a nonempty common intersection.
reviewed by: Horst Martini
Mathematics Subject Classification ID: 52B11
zbMATH DE Number: 739175
zbMATH Keywords: cyclic polytope
zbMATH Keywords: moment curve
zbMATH Keywords: Radon's theorem
MaRDI profile type: Publication
cites work: Some Erdős-Szekeres type results about points in space
cites work: Q5547252
cites work: Konvexe Fünfecke in ebenen Punktmengen
cites work: Sets with No Empty Convex 7-Gons
cites work: Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
Recommended article: Empty convex polygons in almost convex sets
Recommended article: On empty convex polygons in a planar point set
Recommended article: Q3619942
Recommended article: Empty convex hexagons in planar point sets
Recommended article: Large empty convex polygons in \(k\)-convex sets
Recommended article: Q5391619
Recommended article: Searching for empty convex polygons
Recommended article: Q4252218
Recommended article: Q3359792
description: scientific article; zbMATH DE number 739175