← All problems

Exact certificate-degree problem for tensor decompositions

For every complex tensor TT of order n≥2n\ge 2 and tensor rank greater than 22, determine the minimum Nullstellensatz certificate degree for the original two-term decomposition equations associated with TT; the manuscript claims that this degree is exactly 3n3n. In addition, for every nonzero nilpotent matrix N∈Cm×mN\in\mathbb{C}^{m\times m}, determine the value or best possible bounds for δm(Im,N)\delta_m(I_m,N); the manuscript claims 3m+3≤δm(Im,N)≤3m+63m+3\le \delta_m(I_m,N)\le 3m+6. The supplied sources do not specify the underlying two-term equations or the precise definition of δm\delta_m, so these claims cannot be formalized more fully from the available material.

References

Progress summary

Refreshed
Open

An unrefereed manuscript claims an exact degree for one tensor family and narrower bounds for a related matrix problem, but the claims have not been independently verified.

The problem asks for exact certificate complexity in a specified tensor-decomposition family, together with bounds for a related matrix problem. No proposer or original date is identified in the retrieved material.

November 2026 claimed advance

The manuscript claims certificate degree 3n3n for complex tensors of order n≥2n \ge 2 and rank greater than 22. It also claims 3m+3≤δm(Im,N)≤3m+63m+3 \le \delta_m(I_m,N) \le 3m+6 for nonzero nilpotent m×mm \times m matrices. The result is presented in an unrefereed repository manuscript, with no external mathematical verification found.

Current status (as of November 2026): The stated tensor-family degree and matrix bounds are claimed, but remain unverified; no complete resolution of the broader problem is established.

Sources

Solutions 0

No solutions have been posted yet.