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

容斥公式的简化

Simplifying inclusion-exclusion formulas

Xavier Goaoc, Jiří Matoušek, Pavel Paták, Zuzana Safernová, Martin Tancer

摘要:

令$\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$是基集合$S$上的$n$集合族,例如$\mathbb{R}^d$中的球族。对于$S$上的每一个有限测度$μ$,使得$\mathcal{F}$的集合是可测的,经典的包含-排除公式断言$μ(F_1\cup F_2\cup\cdots\cup F_n)=\sum_{I:\emptyset\ne I\subseteq[n]} (-1)^{|I|+1}μ\Bigl(\bigcap_{i\in I} F_i\Bigr)$ ;也就是说,并集的测度用各种交集的测度来表示。在$n$中,该公式中的项的数量是指数的,并且源自应用领域的大量研究一直致力于为特定家族$\mathcal{F}$构建更简单的公式。我们提供了一个上限有效的任意$\mathcal{F}$:我们表明,每个系统$\mathcal{F}$的$n$集与$m$非空字段的维恩图承认一个包含-排除公式与$m^{O(\log^2n)}$条款和$\pm1$系数,这样的公式可以计算在$m^{O(\log^2n)}$预期的时间。对于每一个$\varepsilon>0$,我们还构造了具有大小为$m$的Venn图的系统,对于该系统,每个有效的包含-排除公式的系数绝对值之和至少为$Ω(m^{2-\varepsilon})$。

英文摘要:

Let $\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$ be a family of $n$ sets on a ground set $S$, such as a family of balls in $\mathbb{R}^d$. For every finite measure $μ$ on $S$, such that the sets of $\mathcal{F}$ are measurable, the classical inclusion-exclusion formula asserts that $μ(F_1\cup F_2\cup\cdots\cup F_n)=\sum_{I:\emptyset\ne I\subseteq[n]} (-1)^{|I|+1}μ\Bigl(\bigcap_{i\in I} F_i\Bigr)$; that is, the measure of the union is expressed using measures of various intersections. The number of terms in this formula is exponential in $n$, and a significant amount of research, originating in applied areas, has been devoted to constructing simpler formulas for particular families $\mathcal{F}$. We provide an upper bound valid for an arbitrary $\mathcal{F}$: we show that every system $\mathcal{F}$ of $n$ sets with $m$ nonempty fields in the Venn diagram admits an inclusion-exclusion formula with $m^{O(\log^2n)}$ terms and with $\pm1$ coefficients, and that such a formula can be computed in $m^{O(\log^2n)}$ expected time. For every $\varepsilon>0$ we also construct systems with Venn diagram of size $m$ for which every valid inclusion-exclusion formula has the sum of absolute values of the coefficients at least $Ω(m^{2-\varepsilon})$.

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

↑