使用局部条件界定全局红蓝比例
Bounding a global red-blue proportion using local conditions
摘要:
我们研究了以下局部到全局的现象:设$B$和$R$是欧氏平面$\mathbb{R}^2$上的两个有限的(蓝色和红色)点集。假设在红点的每个“邻域”中,蓝点的数量至少与红点的数量一样大。我们证明,在这种情况下,蓝点的总数至少是红点总数的五分之一。我们还表明,这个界是最佳的,我们推广的结果,任意尺寸和任意范数使用的结果从闵可夫斯基安排。
英文摘要:
We study the following local-to-global phenomenon: Let $B$ and $R$ be two finite sets of (blue and red) points in the Euclidean plane $\mathbb{R}^2$. Suppose that in each "neighborhood" of a red point, the number of blue points is at least as large as the number of red points. We show that in this case the total number of blue points is at least one fifth of the total number of red points. We also show that this bound is optimal and we generalize the result to arbitrary dimension and arbitrary norm using results from Minkowski arrangements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。