Exact certificate-degree problem for tensor decompositions
For every complex tensor of order and tensor rank greater than , determine the minimum Nullstellensatz certificate degree for the original two-term decomposition equations associated with ; the manuscript claims that this degree is exactly . In addition, for every nonzero nilpotent matrix , determine the value or best possible bounds for ; the manuscript claims . The supplied sources do not specify the underlying two-term equations or the precise definition of , so these claims cannot be formalized more fully from the available material.
References
Source: Zenodo
Progress summary
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 for complex tensors of order and rank greater than . It also claims for nonzero nilpotent 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.