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

GF(2)多项式的Fourier稀疏性

Fourier Sparsity of GF(2) Polynomials

Hing Yin Tsang, Ning Xie, Shengyu Zhang

摘要:

我们研究了最近在(Tsang et al.,FOCS'13),其断言如果需要许多线性约束来降低GF(2)多项式的次数,则多项式的傅立叶稀疏性(即非零傅立叶系数的数量)必须很大。我们注意到,该猜想隐含着一个令人惊讶的现象,即如果GF(2)多项式的最高次单项式满足一定的条件,则多项式的傅立叶稀疏性是大的,而不管较低次的单项式的数量通常远大于最高次单项式的数量。我们发展了一种新的证明GF(2)多项式的Fourier稀疏性下界的方法,并将其应用于某些特殊类型的多项式,以展示上述现象。

英文摘要:

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number of non-zero Fourier coefficients) of the polynomial must be large. We notice that the conjecture implies a surprising phenomenon that if the highest degree monomials of a GF(2) polynomial satisfy a certain condition, then the Fourier sparsity of the polynomial is large regardless of the monomials of lower degrees -- whose number is generally much larger than that of the highest degree monomials. We develop a new technique for proving lower bound on the Fourier sparsity of GF(2) polynomials, and apply it to certain special classes of polynomials to showcase the above phenomenon.

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

↑