arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.03374cs.DS
收藏

关于随机低次集系统的差异性

On the discrepancy of random low degree set systems

Nikhil Bansal, Raghu Meka

摘要:

受著名的Beck-Fiala猜想的启发,我们考虑了随机集上有$n$元素和$m$集合,并且每个元素都位于$t$随机选择集合中.在这种情况下,Ezra和Lovett显示当$n \leq m$时,在该机制中结合了$O((t \log t)^{1/2})$差异,当$n \gg m^t$时,结合了$O(1)$。在本文中,我们给出了一个紧的$O(\sqrt{t})$的整个范围的$n$和$m$,在一个温和的假设下,$t = Ω(\log \log m)^2$。结果基于两个步骤。首先,应用部分着色方法的情况下,当$n = m \log^{O(1)} m$和使用的随机集系统的性质,我们表明,所产生的总体差异最多是$O(\sqrt{t})$。其次,我们减少了一般情况下的$n \leq m \log^{O(1)}m$使用LP对偶和仔细计数的论点。

英文摘要:

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$ discrepancy bound in the regime when $n \leq m$ and an $O(1)$ bound when $n \gg m^t$. In this paper, we give a tight $O(\sqrt{t})$ bound for the entire range of $n$ and $m$, under a mild assumption that $t = Ω(\log \log m)^2$. The result is based on two steps. First, applying the partial coloring method to the case when $n = m \log^{O(1)} m$ and using the properties of the random set system we show that the overall discrepancy incurred is at most $O(\sqrt{t})$. Second, we reduce the general case to that of $n \leq m \log^{O(1)}m$ using LP duality and a careful counting argument.

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

↑