Oeding's symmetric border-rank conjecture for general monomials
Statement
Let . For the monomial , its symmetric border rank is the least number of powers of linear forms needed in a limiting symmetric decomposition. Oeding's conjecture. The symmetric border rank is
This gives the conjectured symmetric border rank of a general monomial and complements the known formula for its Waring rank. The supplied text does not state whether the conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.