ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m>2m>2 and let Π2m∗\Pi^*_{2^m} denote the polynomial set associated with evaluation schemes using 2m2^m matrix-matrix multiplications. Numerical computations suggest that generic unreduced schemes give the sharp parameter count. Dimension conjecture.

dim⁡(Π2m∗)=m2.\dim(\Pi^*_{2^m})=m^2.

The preceding argument proves only the upper bound dim⁡(Π2m∗)≤m2\dim(\Pi^*_{2^m})\leq m^2; equality was verified numerically for m≤10m\leq 10, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.