← All problems

Christandl–Vrana–Zuiddam complete-graph tensor question

For each integer n≥2n\ge 2, determine the asymptotic rank R~(GT2(Kn))\widetilde R\bigl(\mathsf{GT}_2(K_n)\bigr) over C\mathbb{C}, equivalently determine the exact value of log⁡2R~(GT2(Kn))\log_2\widetilde R\bigl(\mathsf{GT}_2(K_n)\bigr). In particular, resolve the remaining odd-order cases, for which the known bounds are ⌊n2/4⌋≤log⁡2R~(GT2(Kn))≤n2/4\left\lfloor n^2/4\right\rfloor\le \log_2\widetilde R\bigl(\mathsf{GT}_2(K_n)\bigr)\le n^2/4.

Equivalent formulations
  1. Determine whether there exists an integer k≥5k\ge 5 such that the asymptotic exponent per edge of the complete-graph tensor satisfies τ(T(Kk))<2/3\tau\bigl(T(K_k)\bigr)<2/3.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new unrefereed preprint claims a major partial advance, but the complete question remains open because the odd-order case is not exact.

Christandl, Vrana, and Zuiddam posed the problem in their 2019 paper, asking for the asymptotic exponent of complete-graph tensors and whether it can fall below 2/32/3 for some k≥5k \ge 5.

Known results

  • Christandl, Vrana, and Zuiddam (2019): τ(T(Kk))≤0.772943\tau(T(K_k)) \le 0.772943 for every k≥4k \ge 4.
  • Their flattening bounds give τ(T(Kk))≥1/2+1/(2(k−1))\tau(T(K_k)) \ge 1/2+1/(2(k-1)) for even kk and τ(T(Kk))≥1/2+1/(2k)\tau(T(K_k)) \ge 1/2+1/(2k) for odd kk.
  • The paper explicitly left open whether τ(T(Kk))<2/3\tau(T(K_k))<2/3 for some k≥5k \ge 5.

October 2026 claimed advance

Huanyi Zhou's preprint reports τ(T(Kk))<2/3\tau(T(K_k))<2/3 for every k≥5k \ge 5, with an exact result for even kk and a near-exact result for odd kk. The odd-order gap remains, and the preprint is unrefereed, so this is claimed progress rather than a verified resolution.

Current status (as of October 2026): the classical bounds and open formulation are established, while Zhou's below-2/32/3 advance is unverified and the odd-order case remains unresolved.

Sources

Solutions 0

No solutions have been posted yet.