arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.06338math.CO
收藏

关于满足$(p,q)_r$性质的族的穿透数

On Piercing Numbers of Families Satisfying the $(p,q)_r$ Property

Chaya Keller, Shakhar Smorodinsky

摘要:

Hadwiger-Debrunner数$HD_d(p,q)$是在满足$(p,q)$性质的$\mathbb{R}^d$中,对于一族紧凸集,总是可以保证的刺穿集的最小尺寸。Hadwiger和Debrunner表明,$HD_d(p,q) \geq p-q+1$对所有$q$,并达到平等的$q > \frac{d-1}{d}p +1$。几乎紧的上限为$HD_d(p,q)$的一个“足够大的”$q$最近获得了著名的Alon-Kleitman定理的增强,但没有尖锐的上限为一般的$q$是已知的。在[L. Montejano和P. Soberón,平衡和不平衡家庭的穿透数,Disc。Comput. Geom.,45(2)(2011),pp. 358-364],Montejano和Soberón定义了$(p,q)$性质的细化:如果在$F$的任何$p$元素中,至少$q$元组的$r$相交,则$F$满足$(p,q)_r$性质。他们表明,$HD_d(p,q)_r \leq p-q+1$对所有$r>{{p}\choose{q}}-{{p+1-d}\choose{q+1-d}}$都成立;然而,这远远不是严格的。在本文中,我们提出了改进的渐近上界$HD_d(p,q)_r$举行时,只有一小部分的$q$ -元组相交。特别是,我们表明,$p,q$足够大,$HD_d(p,q)_r \leq p-q+1$持有与$r = \frac{1}{p^{\frac{q}{2d}}}{{p}\choose{q}}$。我们的界限错过了已知的下限相同的穿孔数的一个因素小于$pq^d$。我们的结果使用Kalai的凸集上界定理,Hadwiger-Debrunner定理和最近改进的上界$HD_d(p,q)$上面提到的。

英文摘要:

The Hadwiger-Debrunner number $HD_d(p,q)$ is the minimal size of a piercing set that can always be guaranteed for a family of compact convex sets in $\mathbb{R}^d$ that satisfies the $(p,q)$ property. Hadwiger and Debrunner showed that $HD_d(p,q) \geq p-q+1$ for all $q$, and equality is attained for $q > \frac{d-1}{d}p +1$. Almost tight upper bounds for $HD_d(p,q)$ for a `sufficiently large' $q$ were obtained recently using an enhancement of the celebrated Alon-Kleitman theorem, but no sharp upper bounds for a general $q$ are known. In [L. Montejano and P. Soberón, Piercing numbers for balanced and unbalanced families, Disc. Comput. Geom., 45(2) (2011), pp. 358-364], Montejano and Soberón defined a refinement of the $(p,q)$ property: $F$ satisfies the $(p,q)_r$ property if among any $p$ elements of $F$, at least $r$ of the $q$-tuples intersect. They showed that $HD_d(p,q)_r \leq p-q+1$ holds for all $r>{{p}\choose{q}}-{{p+1-d}\choose{q+1-d}}$; however, this is far from being tight. In this paper we present improved asymptotic upper bounds on $HD_d(p,q)_r$ which hold when only a tiny portion of the $q$-tuples intersect. In particular, we show that for $p,q$ sufficiently large, $HD_d(p,q)_r \leq p-q+1$ holds with $r = \frac{1}{p^{\frac{q}{2d}}}{{p}\choose{q}}$. Our bound misses the known lower bound for the same piercing number by a factor of less than $pq^d$. Our results use Kalai's Upper Bound Theorem for convex sets, along with the Hadwiger-Debrunner theorem and the recent improved upper bound on $HD_d(p,q)$ mentioned above.

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

↑