Sign conjecture for Steiner distance hyperdeterminants
Statement
Let be a tree on vertices, let be its order- Steiner distance hypermatrix, and write for if , if , and if .
Sign conjecture. For any tree on vertices,
when this quantity is nonzero.
The conjecture appears in earlier work and has been checked numerically for , , and . It is trivially true for and odd , and follows from Graham–Pollak when ; its general status is not established in the supplied text.
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.