Bounded-dimensional support conjecture for minimal slice-rank decompositions

Let d3d \ge 3 and k1k \ge 1 be integers. An order-dd tensor TT over a field F\mathbb{F} has slice rank kk if it can be expressed using kk slices, where each slice has the form of a function in one variable multiplied by a function in the remaining d1d-1 variables. For each mode, write [nj]={1,,nj}[n_j]=\{1,\dots,n_j\}, and let xj\overline{x_j} denote the tuple of variables other than xjx_j.

Bounded-dimensional support conjecture. There exists a positive integer C(d,k)C(d,k) such that, for every order-dd tensor TT over an arbitrary field F\mathbb{F} with slice rank kk, there are linear subspaces

A1Fn1,,AdFndA_1 \subset \mathbb{F}^{n_1},\dots,A_d \subset \mathbb{F}^{n_d}

with dimension at most C(d,k)C(d,k) such that the following holds: whenever r1,,rdr_1,\dots,r_d are nonnegative integers satisfying

\nr1++rd=k,\nr_1+\dots+r_d=k,

and functions aj,i:[nj]Fa_{j,i}:[n_j]\to\mathbb{F}, for j[d]j\in[d] and i[rj]i\in[r_j], together with functions bj,i:jj[nj]Fb_{j,i}:\prod_{j'\ne j}[n_{j'}]\to\mathbb{F}, satisfy

T(x1,,xd)=j=1di=1rjaj,i(xj)bj,i(xj),T(x_1,\dots,x_d)=\sum_{j=1}^d\sum_{i=1}^{r_j}a_{j,i}(x_j)b_{j,i}(\overline{x_j}),

then

a1,1,,a1,r1A1,,ad,1,,ad,rdAd.\langle a_{1,1},\dots,a_{1,r_1}\rangle\subset A_1,\dots,\langle a_{d,1},\dots,a_{d,r_d}\rangle\subset A_d.

This would give a field-uniform bound on the subspaces supporting the one-variable factors in every minimal-length slice-rank decomposition. The question arises because the paper's preceding results do not provide such a uniform statement: over infinite fields the analogous theorem fails, while over finite fields the available bounds depend on the field and can grow square-exponentially in the slice rank. The source presents this as an open question rather than reporting a resolution.

Sources & referencesView supporting material

Primary source

Thomas Karam, “Small sunflowers and the structure of slice rank decompositions”, arXiv:2308.07101 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.