关于对称函数的谱性质
On the Spectral Properties of Symmetric Functions
摘要:
本文用对称函数的简单组合测度刻画了对称函数的近似单项复杂性、符号单项复杂性和近似L1范数。我们对近似L1范数的刻画解决了[AFH12]中的主要猜想.作为符号单项复杂性刻画的一个应用,我们证明了文[1909]中的一个猜想,并给出了符号异或函数的无界错误通信复杂性的一个刻画.
英文摘要:
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm solves the main conjecture in [AFH12]. As an application of the characterization of the sign monomial complexity, we prove a conjecture in [ZS09] and provide a characterization for the unbounded-error communication complexity of symmetric-xor functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。