English

Direct Sum Testing: The General Case

Computational Complexity 2019-10-11 v2 Discrete Mathematics

Abstract

A function f:[n1]××[nd]F2f:[n_1]\times\dots\times[n_d]\to\mathbb{F}_2 is a direct sum if it is of the form f(a1,,ad)=f1(a1)fd(ad),f\left(a_1,\dots,a_d\right) = f_1(a_1)\oplus\dots \oplus f_d (a_d), for some dd functions fi:[ni]F2f_i:[n_i]\to\mathbb{F}_2 for all i=1,,di=1,\dots, d, and where n1,,ndNn_1,\dots,n_d\in\mathbb{N}. We present a 44-query test which distinguishes between direct sums and functions that are far from them. The test relies on the BLR linearity test (Blum, Luby, Rubinfeld, 1993) and on an agreement test which slightly generalizes the direct product test (Dinur, Steurer, 2014). In multiplicative ±1\pm 1 notation, our result reads as follows. A dd-dimensional tensor with ±1\pm 1 entries is called a tensor product if it is a tensor product of dd vectors with ±1\pm 1 entries, or equivalently, if it is of rank 11. The presented tests can be read as tests for distinguishing between tensor products and tensors that are far from being tensor products. We also present a different test, which queries the function at most (d+2)(d+2) times, but is easier to analyze.

Cite

@article{arxiv.1904.12747,
  title  = {Direct Sum Testing: The General Case},
  author = {Irit Dinur and Konstantin Golubev},
  journal= {arXiv preprint arXiv:1904.12747},
  year   = {2019}
}
R2 v1 2026-06-23T08:52:24.496Z