A problem on distance matrices of subsets of the Hamming cube
From MaRDI portal
Publication:5072246
Abstract: Let denote the distance matrix for an point metric space . In the case that is an unweighted metric tree, the sum of the entries in is always equal to . Such trees can be considered as affinely independent subsets of the Hamming cube , and it was conjectured that the value 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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 3507416 (Why is no real title available?)
- Corrigendum to "On Isometric Embeddings of Graphs"
- DISTANCE GEOMETRY IN QUASIHYPERMETRIC SPACES. I
- Distance geometry in quasihypermetric spaces. II
- Distance geometry in quasihypermetric spaces. III
- Distance matrices of subsets of the Hamming cube
- Distance matrix polynomials of trees
- Estimating the gap of finite metric spaces of strict \(p\)-negative type
- Extremal Problems of Distance Geometry Related to Energy Integrals
- Finite quasihypermetric spaces
- Generalized roundness and negative type
- Metric Spaces and Positive Definite Functions
- On Isometric Embeddings of Graphs
- On the Addressing Problem for Loop Switching
- On the gap of finite metric spaces of \(p\)-negative type
- On the supremal p-negative type of finite metric spaces
- Supremal \(p\)-negative type of vertex transitive graphs
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)