Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Direct Sum Testing: The General Case (1904.12747v2)

Published 29 Apr 2019 in cs.CC and cs.DM

Abstract: A function $f:[n_1]\times\dots\times[n_d]\to\mathbb{F}_2$ is a direct sum if it is of the form $f\left(a_1,\dots,a_d\right) = f_1(a_1)\oplus\dots \oplus f_d (a_d),$ for some $d$ functions $f_i:[n_i]\to\mathbb{F}_2$ for all $i=1,\dots, d$, and where $n_1,\dots,n_d\in\mathbb{N}$. We present a $4$-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 $\pm 1$ notation, our result reads as follows. A $d$-dimensional tensor with $\pm 1$ entries is called a tensor product if it is a tensor product of $d$ vectors with $\pm 1$ entries, or equivalently, if it is of rank $1$. 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)$ times, but is easier to analyze.

Citations (2)

Summary

We haven't generated a summary for this paper yet.