arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.00746cs.CCmath.COmath.PR
收藏

多线性代数分支程序下界证明的无条件障碍

An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds

Deepanshu Kush

AI总结:

本文证明了多线性代数分支程序下界证明中min-partition rank方法的局限性,指出需要新的技术来区分mVBP与多线性层次中的更高类。

摘要:

自Raz(2006)突破性地证明了超多项式多线性公式下界以来,证明多线性代数分支程序(mABP)的下界一直是代数复杂性理论中的长期开放问题。所有已知的多线性下界都依赖于min-partition rank方法,而针对mABP的最佳下界仍保持二次(Alon, Kumar, and Volk, Combinatorica 2020)。我们证明min-partition rank方法无法证明超多项式mABP下界:存在一个满秩的多线性多项式,可由多项式大小的mABP计算。这是无条件的障碍:需要新的技术来区分mVBP与多线性层次中的更高类。我们的证明解决了Fabris, Limaye, Srinivasan, 和Yehudayoff(ECCC 2026)提出的一个开放问题,他们展示了该方法的功率由一种称为1-平衡链集系统的组合对象的最小大小N(n)所决定,并证明了N(n) ≤n^{O(log n/log log n)}。我们证明N(n)=n^{O(1)},通过在每一步给链构建者二元选择,将对称随机游走偏转为一个不平衡增加的概率不超过1/4的游走;超几何论证结合多尺度递归得出多项式界。

英文摘要:

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic complexity theory. All known multilinear lower bounds rely on the min-partition rank method, and the best bounds against mABPs have remained quadratic (Alon, Kumar, and Volk, Combinatorica 2020). We show that the min-partition rank method cannot prove superpolynomial mABP lower bounds: there exists a full-rank multilinear polynomial computable by a polynomial-size mABP. This is an unconditional barrier: new techniques are needed to separate $\mathsf{mVBP}$ from higher classes in the multilinear hierarchy. Our proof resolves an open problem of Fabris, Limaye, Srinivasan, and Yehudayoff (ECCC 2026), who showed that the power of this method is governed by the minimum size $N(n)$ of a combinatorial object called a $1$-balanced-chain set system, and proved $N(n) \le n^{O(\log n/\log\log n)}$. We prove $N(n) = n^{O(1)}$ by giving the chain-builder a binary choice at each step, biasing what was a symmetric random walk into one where the imbalance increases with probability at most $1/4$; a supermartingale argument combined with a multi-scale recursion yields the polynomial bound.

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

↑