English

Determinants of Steiner Distance Hypermatrices

Combinatorics 2025-05-16 v1

Abstract

Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-kk Steiner distance hypermatrices of trees on nn vertices. We show that they can be nearly diagonalized as kk-forms, generalizing a result of Graham-Lov\'{a}sz, 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 kk and nn -- as Graham-Pollak showed for k=2k=2. We conclude with some open questions.

Keywords

Cite

@article{arxiv.2505.10501,
  title  = {Determinants of Steiner Distance Hypermatrices},
  author = {Joshua Cooper and Zhibin Du},
  journal= {arXiv preprint arXiv:2505.10501},
  year   = {2025}
}

Comments

10 pages, 1 figure

R2 v1 2026-06-28T23:34:47.966Z