Dot-product realisation conjecture for locally completable graphs
Statement
Let be a semisimple graph with that is locally completable in . Let be the dot-product measurement map in dimension , and let be finite.
Dot-product realisation conjecture. One has
and this bound is tight.
The source says that a similar approach might provide a full solution, so the statement remains prospective and open.
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.