A problem on distance matrices of subsets of the Hamming cube

From MaRDI portal
Publication:5072246

DOI10.1090/BPROC/122zbMATH Open1497.46027arXiv2109.07052OpenAlexW3199237576WikidataQ114094370 ScholiaQ114094370MaRDI QIDQ5072246FDOQ5072246

R. Wolf, Ian Doust

Publication date: 27 April 2022

Published in: Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)

Abstract: Let D denote the distance matrix for an n+1 point metric space (X,d). In the case that X is an unweighted metric tree, the sum of the entries in D1 is always equal to 2/n. Such trees can be considered as affinely independent subsets of the Hamming cube Hn, and it was conjectured that the value 2/n was minimal among all such subsets. In this paper we confirm this conjecture and give a geometric interpretation of our result which applies to any subset of Hn.


Full work available at URL: https://arxiv.org/abs/2109.07052





Cites Work


Cited In (2)






This page was built for publication: A problem on distance matrices of subsets of the Hamming cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072246)