arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.2339math.COmath.PR
收藏

联盟规模

Size of Union

Yuanzhong Ou, Boli Wang, Min Yan

摘要:

我们找到了满足任意k个集合的交为空的条件的n个集合的并集的大小的界。我们表明,任何数量之间的上限和下界可以实现,并在措施的版本,实现可以是最有效的。实现也适用于计数版本,但并不总是以最有效的方式。基本结果应该是已知的,但令人惊讶的是,我们找不到任何参考。

英文摘要:

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the realisation can be the most efficient. The realisation also holds for the counting version, but not always in the most efficient way. The elementary result should be known but surprisingly, we cannot find any reference.

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

↑