SEPARATION OF A FINITE-SET IN R(D) BY SPANNED HYPERPLANES

被引:8
|
作者
KUPITZ, YS [1 ]
机构
[1] HEBREW UNIV JERUSALEM,INST MATH,JERUSALEM,ISRAEL
关键词
AMS subject classification code (1991): 52A35; 52C10;
D O I
10.1007/BF01202351
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A question of the following kind will concern us here: what is the minimal number n, ensuring that any spanning set of n points in 3-space spans a plane, every open side of which contains at least. say, 1000 points of the set. The answer is n = 4001 (see Theorem 2.1 below).
引用
收藏
页码:249 / 258
页数:10
相关论文
共 50 条