中心线的上限
Upper bounds for centerlines
摘要:
在2008年,Bukh、Matousek和Nivasch证明,对于R^d中的每个n点集S和每个k,0 <= k <= d-1,在R^d中存在一个k平坦的f(一个“中心平坦的”),它位于S中的“深度”(k+1)n /(k+d+1)- O(1),在这个意义上,每个包含f的半空间至少包含S的那么多个点。这个主张对于k=0(这是Rado中心点定理)和k = d-1(平凡)都是正确的和紧的。Bukh等人证明了在深度(d-1)n /(2d-1)- O(1)处存在(d-2)-平坦(k = d-2)。在本文中,我们集中在情况k=1(“中心线”的情况下),其中的领先常数的约束值为2/(d+2)。我们证明了2/(d+2)是首常数的一个上界。具体地说,我们证明了对于每个固定的d和每个n,存在R^d中的n点集,对于该点集,R^d中没有线位于大于2n/(d+2)+ o(n)的深度。这个点集是“拉伸网格”-一个以前被Bukh等人用于其他相关目的的集合。因此,特别地,对于R^3,这个猜想现在得到了解决。
英文摘要:
In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every halfspace that contains f contains at least that many points of S. This claim is true and tight for k=0 (this is Rado's centerpoint theorem), as well as for k = d-1 (trivial). Bukh et al. showed the existence of a (d-2)-flat at depth (d-1) n / (2d-1) - O(1) (the case k = d-2). In this paper we concentrate on the case k=1 (the case of "centerlines"), in which the conjectured value for the leading constant is 2/(d+2). We prove that 2/(d+2) is an *upper bound* for the leading constant. Specifically, we show that for every fixed d and every n there exists an n-point set in R^d for which no line in R^d lies at depth larger than 2n/(d+2) + o(n). This point set is the "stretched grid"---a set which has been previously used by Bukh et al. for other related purposes. Hence, in particular, the conjecture is now settled for R^3.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。