arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1403.8147math.MGmath.CO
收藏

单形中Pach选择定理和最小立体角的界

Bounds for Pach's selection theorem and for the minimum solid angle in a simplex

Roman Karasev, Jan Kynčl, Pavel Paták, Zuzana Patáková, Martin Tancer

摘要:

我们估计Pach在下面的几何选择定理中的选择常数:对于每个正整数$d$,存在常数$c_d > 0$,使得每当$X_1,..., X_{d+1}$是$\mathbb{R}^d$的$n$ -元素子集时,则我们可以找到点$\mathbf{p} \in \mathbb{R}^d$和每个$i \in [d+1]$的子集$Y_i \subseteq X_i$,每个子集的大小至少为$c_d n$,使得$\mathbf{p}$属于由$Y_1,..., Y_{d+1}$确定的所有{ \em rainbow} $d$ -单形,即,在每个$Y_i$中具有一个顶点的单形。我们显示了超指数下降的上限$c_d\leq e^{-(1/2-o(1))(d \ln d)}$。在上界证明中使用的思想也帮助我们用$c_d \geq 2^{-2^{d^2 + O(d)}}$证明Pach定理,$c_d \geq 2^{-2^{d^2 + O(d)}}$是$d$中双指数下降的下界(直到指数的某个多项式)。为了比较,Pach的原始方法产生了一个三倍指数下降的下限。另一方面,Fox,Pach和Suk最近获得了一个超图密度结果,暗示了Pach定理的$c_d \geq2^{-O(d^2\log d)}$证明。在我们构造上界时,我们利用了每个$d$ -单形的最小立体角是超指数小的这一事实。这一事实以前是未知的,可能是独立的利益。对于下界,我们改进了“分离”部分的论点表明,在一个关键步骤,只有$d+1$分离是必要的,相比$2^d$分离在原来的证明。我们还提供了一个测量版本的Pach定理。

英文摘要:

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_d > 0$ such that whenever $X_1,..., X_{d+1}$ are $n$-element subsets of $\mathbb{R}^d$, then we can find a point $\mathbf{p} \in \mathbb{R}^d$ and subsets $Y_i \subseteq X_i$ for every $i \in [d+1]$, each of size at least $c_d n$, such that $\mathbf{p}$ belongs to all {\em rainbow} $d$-simplices determined by $Y_1,..., Y_{d+1}$, that is, simplices with one vertex in each $Y_i$. We show a super-exponentially decreasing upper bound $c_d\leq e^{-(1/2-o(1))(d \ln d)}$. The ideas used in the proof of the upper bound also help us prove Pach's theorem with $c_d \geq 2^{-2^{d^2 + O(d)}}$, which is a lower bound doubly exponentially decreasing in $d$ (up to some polynomial in the exponent). For comparison, Pach's original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach's theorem with $c_d \geq2^{-O(d^2\log d)}$. In our construction for the upper bound, we use the fact that the minimum solid angle of every $d$-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the "separation" part of the argument by showing that in one of the key steps only $d+1$ separations are necessary, compared to $2^d$ separations in the original proof. We also provide a measure version of Pach's theorem.

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

↑