arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.3380cs.CGcs.DMmath.CO
收藏

彩色Carathéodory定理的进一步推广

A further generalization of the colourful Carathéodory theorem

Frédéric Meunier, Antoine Deza

摘要:

给定$d+1$集合或颜色,$\mathbb{R}^d$中的点,{ \em colorful}集合是集合$S\subseteq\bigcup_i S_i$,使得$|S\cap S_i|\leq 1$对于$i=1,...,d+1$。一个色集$S$的凸包称为{ \em colorful simplex}。Bárány的彩色Carathéodory定理断言,如果原点0包含在$i=1,...,d+1$的$S_i$的凸包中,则存在包含0的彩色单形。Arocha等人和Holmsen等人将含0的色单形存在的充分条件推广到0包含在$1\leq i< j \leq d+1$的凸包中,从而得到了新的色Carathéodory定理.在推广的条件下,给出了求含0的色单形的一个算法。在平面上的替代,更一般,证明使用图形。此外,我们观察到,任何条件意味着存在一个彩色单形包含0实际上意味着存在$\min_i|S_i|$这样的单形。

英文摘要:

Given $d+1$ sets, or colours, $S_1, S_2,...,S_{d+1}$ of points in $\mathbb{R}^d$, a {\em colourful} set is a set $S\subseteq\bigcup_i S_i$ such that $|S\cap S_i|\leq 1$ for $i=1,...,d+1$. The convex hull of a colourful set $S$ is called a {\em colourful simplex}. Bárány's colourful Carathéodory theorem asserts that if the origin 0 is contained in the convex hull of $S_i$ for $i=1,...,d+1$, then there exists a colourful simplex containing 0. The sufficient condition for the existence of a colourful simplex containing 0 was generalized to 0 being contained in the convex hull of $S_i\cup S_j$ for $1\leq i< j \leq d+1$ by Arocha et al. and by Holmsen et al. We further generalize the sufficient condition and obtain new colourful Carathéodory theorems. We also give an algorithm to find a colourful simplex containing 0 under the generalized condition. In the plane an alternative, and more general, proof using graphs is given. In addition, we observe that any condition implying the existence of a colourful simplex containing 0 actually implies the existence of $\min_i|S_i|$ such simplices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑