期刊文献+

STUDY OF UPPER BOUND PROBLEM OF HEILBRONN TYPE

STUDY OF UPPER BOUND PROBLEM OF HEILBRONN TYPE
下载PDF
导出
摘要 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.
作者 TianZhengping
机构地区 Dept.ofMath.
出处 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第4期455-458,共4页 高校应用数学学报(英文版)(B辑)
关键词 combinatorial geometry DISTANCE greatest lower bound upper bound Mathematica4.0. combinatorial geometry,distance,greatest lower bound,upper bound,Mathematica4.0.
  • 相关文献

参考文献2

二级参考文献2

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部