ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree on nn vertices, let MM be its order-kk Steiner distance hypermatrix, and write sgn⁡(x)\operatorname{sgn}(x) for 11 if x>0x>0, −1-1 if x<0x<0, and 00 if x=0x=0.

Sign conjecture. For any tree on nn vertices,

sgn⁡(det⁡(M))=(−1)n−1\operatorname{sgn}(\det(M))=(-1)^{n-1}

when this quantity is nonzero.

The conjecture appears in earlier work and has been checked numerically for (k,n)=(4,4)(k,n)=(4,4), (4,5)(4,5), and (6,4)(6,4). It is trivially true for n≤3n\leq 3 and odd kk, and follows from Graham–Pollak when k=2k=2; 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 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.