STUDY OF UPPER BOUND PROBLEM OF HEILBRONN TYPE  

作　　者：TianZhengping 

机构地区：[1]Dept.ofMath.,HangzhouTeachersCollege,Hangzhou310012,China.

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2004年第4期455-458,共4页高校应用数学学报（英文版）（B辑）

摘　　要：A set of n points in the plane determines a total C 2 n distances (some of them may be the same).Let r n be the ratio of the maximum distance to the minimum distance, and R n be the greatest lower bound for r n. By using the mathematical software Mathematica,the author gets the following results in this paper.R 12 ≤2.99496..., R 13 ≤cscπ10.A set of n points in the plane determines a total C 2 n distances (some of them may be the same).Let r n be the ratio of the maximum distance to the minimum distance, and R n be the greatest lower bound for r n. By using the mathematical software Mathematica,the author gets the following results in this paper.R 12 ≤2.99496..., R 13 ≤cscπ10.

关 键 词：combinatorial geometry DISTANCE greatest lower bound upper bound Mathematica4.0. 

分 类 号：O157.3[理学—数学]