关于多线性形式:偏差、相关性和张量秩
On Multilinear Forms: Bias, Correlation, and Tensor Rank
摘要:
本文证明了$GF(2)= \{0,1\}$上多重线性形式的偏置、多重线性形式与低次多项式的相关性以及张量秩之间的新关系。我们证明了多重线性形式和张量的下列结果。1.相关界限:我们表明,随机$d$ -线性形式具有指数低相关性与低次多项式。更确切地说,对于$d \ll 2^{o(k)}$,我们证明了随机$d$ -线性形式$f(X_1,X_2, \dots, X_d) : \left(GF(2)^{k}\right)^d \rightarrow GF(2)$与任何次数至多为$d/10$的多项式具有相关性$2^{-k(1-o(1))}$。这一结果是证明了随机$d$线性形式的偏差,这反过来又证明了随机秩$t$ $d$线性形式是相同的零的概率,给出了近最优的界限。2. Tensor-rank vs Bias:我们表明,如果$d$维张量具有小的秩,那么相关的$d$线性形式的偏差是大的。更确切地说,给定秩至多为$t$的任何$d$维张量$$T :\underbrace{[k]\times \ldots [k]}_{\text{$d$ times}}\to GF(2)$$,相关联的$d$ -线性形式$$f_T(X_1,\ldots,X_d) := \sum_{(i_1,\dots,i_d) \in [k]^d} T(i_1,i_2,\ldots, i_d) X_{1,i_1}\cdot X_{1,i_2}\cdots X_{d,i_d}$$的偏差至少为$\left(1-\frac1{2^{d-1}}\right)^t$ .上面的偏差与张量秩的联系表明了一种自然的方法来证明$d=3$的非平凡张量秩下界。特别是,我们使用这种方法来证明,有限域乘法张量的张量秩至少$3.52 k$匹配的最佳已知的下限为任何显式张量在三维$GF(2)$。
英文摘要:
In this paper, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank of tensors over $GF(2)= \{0,1\}$. We show the following results for multilinear forms and tensors. 1. Correlation bounds : We show that a random $d$-linear form has exponentially low correlation with low-degree polynomials. More precisely, for $d \ll 2^{o(k)}$, we show that a random $d$-linear form $f(X_1,X_2, \dots, X_d) : \left(GF(2)^{k}\right)^d \rightarrow GF(2)$ has correlation $2^{-k(1-o(1))}$ with any polynomial of degree at most $d/10$. This result is proved by giving near-optimal bounds on the bias of random $d$-linear form, which is in turn proved by giving near-optimal bounds on the probability that a random rank-$t$ $d$-linear form is identically zero. 2. Tensor-rank vs Bias : We show that if a $d$-dimensional tensor has small rank, then the bias of the associated $d$-linear form is large. More precisely, given any $d$-dimensional tensor $$T :\underbrace{[k]\times \ldots [k]}_{\text{$d$ times}}\to GF(2)$$ of rank at most $t$, the bias of the associated $d$-linear form $$f_T(X_1,\ldots,X_d) := \sum_{(i_1,\dots,i_d) \in [k]^d} T(i_1,i_2,\ldots, i_d) X_{1,i_1}\cdot X_{1,i_2}\cdots X_{d,i_d}$$ is at least $\left(1-\frac1{2^{d-1}}\right)^t$. The above bias vs tensor-rank connection suggests a natural approach to proving nontrivial tensor-rank lower bounds for $d=3$. In particular, we use this approach to prove that the finite field multiplication tensor has tensor rank at least $3.52 k$ matching the best known lower bound for any explicit tensor in three dimensions over $GF(2)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。