A problem on distance matrices of subsets of the Hamming cube
Proceedings of the American Mathematical Society, Series B · 2022
DOI: 10.1090/bproc/122 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, Series B, 2022. Verfasst von Ian Doust und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 3.0).
Abstract (Originalsprache)
Let D D denote the distance matrix for an n + 1 n+1 point metric space ( X , d ) (X,d) . In the case that X X is an unweighted metric tree, the sum of the entries in D − 1 D^{-1} is always equal to 2 / n 2/n . Such trees can be considered as affinely independent subsets of the Hamming cube H n H_n , and it was conjectured that the value 2 / n 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 H n H_n .
Zitieren
APA
Doust, I., & Wolf, R. (2022). A problem on distance matrices of subsets of the Hamming cube. Proceedings of the American Mathematical Society, Series B. https://doi.org/10.1090/bproc/122
Vancouver
Doust I, Wolf R. A problem on distance matrices of subsets of the Hamming cube. Proceedings of the American Mathematical Society, Series B. 2022. doi:10.1090/bproc/122
BibTeX
@article{Doust2022,
author = {Doust, Ian and Wolf, Reinhard},
title = {A problem on distance matrices of subsets of the Hamming cube},
journal = {Proceedings of the American Mathematical Society, Series B},
year = {2022},
doi = {10.1090/bproc/122}
}
EUVIMED