Determinants of Steiner Distance Hypermatrices
Abstract
Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-k Steiner distance hypermatrices of trees on n vertices. We show that they can be nearly diagonalized as k-forms, generalizing a result of Graham-Lov\'asz, implying a tensor version of ``conditional negative definiteness'', providing new proofs of previous results of the authors and Tauscheck, and resolving the conjecture that these hyperdeterminants depend only on k and n -- as Graham-Pollak showed for k=2. We conclude with some open questions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.