ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree on neq3n eq 3 vertices, let kk be a positive integer, and let d4aeTd4ae_T be the order-kk Steiner distance hypermatrix of TT, whose (v1,d7e2,d7e3,d7e4,d7e5,d7e6)(v_1,d7e2,d7e3,d7e4,d7e5,d7e6) entry is the Steiner distance dT(v1,d7e2,d7e3,d7e4,d7e5,d7e6)d_T(v_1,d7e2,d7e3,d7e4,d7e5,d7e6). Its hyperdeterminant is said to depend on TT only through nn, and to vanish exactly when kk is odd. Steiner distance hyperdeterminant conjecture. The order-kk Steiner distance hypermatrix of a tree TT on ne3n e 3 vertices has a hyperdeterminant that depends on TT only through nn, and this hyperdeterminant is 00 if and only if kk 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 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.