arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.02702math.COcs.CC
收藏

通过稀疏混合研究拟随机群中的角点

Corners in Quasirandom Groups via Sparse Mixing

Michael Jaber, Shachar Lovett, Anthony Ostuni

AI总结:

本文通过提出扩展Kelley-Lovett-Meka工作的一般组合定理,将拟随机群上无角点集合的密度上界改进至拟多项式级,并显著提升3玩家额前数字模型中置换函数通信复杂度的下界。

摘要:

我们将拟随机群上无角点集合密度的已知最佳上界从逆多重对数级改进到拟多项式级。同时,我们对3玩家额前数字模型中一大类置换函数的通信复杂度已知最佳下界做出了同样显著的改进。支撑这两个结果的是一般组合定理,该定理扩展了Kelley、Lovett和Meka(STOC'24)的近期工作,而后者本身是对Kelley和Meka关于三项算术级数的突破性成果(FOCS'23)中思想的进一步发展。

英文摘要:

We improve the best known upper bounds on the density of corner-free sets over quasirandom groups from inverse poly-logarithmic to quasi-polynomial. We make similarly substantial improvements to the best known lower bounds on the communication complexity of a large class of permutation functions in the 3-player Number-on-Forehead model. Underpinning both results is a general combinatorial theorem that extends the recent work of Kelley, Lovett, and Meka (STOC'24), itself a development of ideas from the breakthrough result of Kelley and Meka on three-term arithmetic progressions (FOCS'23).

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

↑