Supremal p-negative type of vertex transitive graphs
From MaRDI portal
Publication:412438
DOI10.1016/J.JMAA.2012.02.042zbMATH Open1239.05091arXiv1112.5657OpenAlexW2036071765MaRDI QIDQ412438FDOQ412438
Authors: Mathav Kishore Murugan
Publication date: 4 May 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1112.5657
Recommendations
Cites Work
- On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space
- Distance-preserving subgraphs of hypercubes
- Generalized roundness and negative type
- Finite metric spaces of strictly negative type
- On a problem of Smirnov
- Hyperbolic spaces are of strictly negative type
- On the gap of finite metric spaces of \(p\)-negative type
- Strict \(p\)-negative type of a metric space
- Enhanced negative type for finite metric trees
- Uniform Embeddings into Hilbert Space and a Question of Gromov
- Title not available (Why is that?)
- Roundness properties of groups.
- Strongly non-embeddable metric spaces
- On the supremal \(p\)-negative type of finite metric spaces
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)