期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
THE PROBLEM OF "STRUNG BALLS" IN HIGH DIMENSION
1
作者 ZHANGWeinian 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第4期574-577,共4页
The problem of “strung balls”, which considers how many circles in a given family of circles can be intersected by a line in a plane, is discussed in R^n(n ≥ 3). Higher dimensional versions of the results given on ... The problem of “strung balls”, which considers how many circles in a given family of circles can be intersected by a line in a plane, is discussed in R^n(n ≥ 3). Higher dimensional versions of the results given on a plane are obtained. 展开更多
关键词 combinatorial geometry DIVERGENCE countable INTERSECTION
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部