Steiner distance hyperdeterminant conjecture for trees
Statement
Let be a tree on vertices, let be a positive integer, and let be the order- Steiner distance hypermatrix of , whose entry is the Steiner distance . Its hyperdeterminant is said to depend on only through , and to vanish exactly when is odd. Steiner distance hyperdeterminant conjecture. The order- Steiner distance hypermatrix of a tree on vertices has a hyperdeterminant that depends on only through , and this hyperdeterminant is if and only if is odd. The surrounding text says that the paper proves results for odd-order Steiner hypermatrices and reports computation suggesting extension to even order, so the full asserted statement is not established in the supplied material.
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.