2000 character limit reached
Determinants of Steiner Distance Hypermatrices (2505.10501v1)
Published 15 May 2025 in math.CO
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\'{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 $k$ and $n$ -- as Graham-Pollak showed for $k=2$. We conclude with some open questions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.