Supremal p-negative type of vertex transitive graphs
From MaRDI portal
Publication:412438
Abstract: We study the generalized roundness of finite metric spaces whose distance matrix has the property that every row of is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube () that have strict -negative type. The result can be stated in two ways: a subset of the Hamming cube has generalized roundness one if and only if the vectors are linearly dependent in . Equivalently, has strict -negative type if and only if the vectors are linearly independent in .
Recommendations
Cites work
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- Distance-preserving subgraphs of hypercubes
- Enhanced negative type for finite metric trees
- Finite metric spaces of strictly negative type
- Generalized roundness and negative type
- Hyperbolic spaces are of strictly negative type
- On a problem of Smirnov
- On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space
- On the gap of finite metric spaces of \(p\)-negative type
- On the supremal \(p\)-negative type of finite metric spaces
- Roundness properties of groups.
- Strict \(p\)-negative type of a metric space
- Strongly non-embeddable metric spaces
- Uniform Embeddings into Hilbert Space and a Question of Gromov
Cited in
(5)
This page was built for publication: Supremal \(p\)-negative type of vertex transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412438)