期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
STUDY OF UPPER BOUND PROBLEM OF HEILBRONN TYPE
1
作者 tianzhengping 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第4期455-458,共4页
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. ... 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.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部