The dimension conjecture for unreduced evaluation schemes with 2^m multiplications
Statement
Let and let denote the polynomial set associated with evaluation schemes using matrix-matrix multiplications. Numerical computations suggest that generic unreduced schemes give the sharp parameter count. Dimension conjecture.
The preceding argument proves only the upper bound ; equality was verified numerically for , but no general proof is supplied.
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.