|
|
|
|
| LEADER |
01035nam a2200145Ia 4500 |
| 001 |
10.1090-bproc-122 |
| 008 |
220630s2022 CNT 000 0 und d |
| 020 |
|
|
|a 23301511 (ISSN)
|
| 245 |
1 |
0 |
|a A PROBLEM ON DISTANCE MATRICES OF SUBSETS OF THE HAMMING CUBE
|
| 260 |
|
0 |
|b American Mathematical Society
|c 2022
|
| 520 |
3 |
|
|a 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 D−1 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. © 2022, American Mathematical Society. All rights reserved.
|
| 700 |
1 |
0 |
|a Doust, I.
|e author
|
| 700 |
1 |
0 |
|a Wolf, R.
|e author
|
| 773 |
|
|
|t Proceedings of the American Mathematical Society, Series B
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.1090/bproc/122
|
