arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.19490cs.CCmath.CO
收藏

在乘积分布下不相交问题的通信复杂度

Communication Complexity of Disjointness under Product Distributions

ETH Zürich(苏黎世联邦理工学院);Umeå University(于默奥大学)

Zach Hunter, Aleksa Milojević, Benny Sudakov, Istvan Tomon

AI总结:

研究在乘积分布下不相交问题的随机通信复杂度,通过简洁证明获得最优界,并改进误差参数的量化依赖。

摘要:

在乘积分布下确定不相交问题的随机通信复杂度是通信复杂度中的核心问题,其根源可追溯到Babai、Frankl和Simon在1980年代的基础工作,最终在Kalyanasundaram-Schnitger和Razborov1992年的著名工作中达到顶峰。然而,获得产品分布的紧界的问题持续存在,直到Bottesch、Gavinsky和Klauck更近期的工作才得以解决。在本笔记中,我们重新审视这个经典问题,并给出最佳界的简洁证明,同时改进了误差参数的量化依赖。我们的方法基于一个可能有独立兴趣的简单组合引理:如果两个独立从两个分布中抽取的集合以非可忽略的概率不相交,则可以提取出两个测量 reasonably 大的子族,这些子族是完全交叉不相交的(等价地,对于不相交问题来说,是一个大的单色矩形)

英文摘要:

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the famous works of Kalyanasundaram-Schnitger and Razborov in 1992. However, the question of obtaining tight bounds for product distributions persisted until the more recent work of Bottesch, Gavinsky, and Klauck resolved it. In this note we revisit this classical problem and give a short, streamlined proof of the best bounds, with improved quantitative dependence on the error parameter. Our approach is based on a simple combinatorial lemma that may be of independent interest: if two sets drawn independently from two distributions are disjoint with non-negligible probability, then one can extract two subfamilies of reasonably large measure that are fully cross-disjoint (equivalently, a large monochromatic rectangle for disjointness).

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

↑