| 关于Heilbron型问题的上下界 |
| |
| 引用本文： | 田正平. 关于Heilbron型问题的上下界[J]. 杭州师范学院学报(社会科学版), 1994, 0(6) |
| |
| 作者姓名： | 田正平 |
| |
| 摘 要： | 平面上ｎ个不同的点间的最大距离和最小距离的比记为ｒｎ，ｒｎ的下确界设为Ｒｎ。在本文中我们求得了Ｒｎ的上、下界，即，这里ｃ１＝１．０５００７５…，ｃ２＝１．１２８３７９…。
|
| 关 键 词： | 距离，下确界 |
ON THE PROBLEM OF HEILBRON TYPE |
| |
| Tian Zhengping. ON THE PROBLEM OF HEILBRON TYPE[J]. Journal of Hangzhou Teachers College(Humanities and Social Sciences), 1994, 0(6) |
| |
| Authors: | Tian Zhengping |
| |
| Affiliation: | Department of Mathematics |
| |
| Abstract: | A set of n points in the plane determines a total of C distances (some distances may be equal). Let rn be the ratio of the maximum distance to the minimum distance. The problem of Heilbron type is to find the least lower bound Rn for rn. In this paper the upper and lower bounds are given for Rn, namely we get the following result for Rn.Theorem, where |
| |
| Keywords: | distance least lower bound |
| 本文献已被 CNKI 等数据库收录！ |
