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 Edit this on Wikidata


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 D has the property that every row of D is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube 0,1nsubsetell1(n) (ngeq1) that have strict 1-negative type. The result can be stated in two ways: a subset S=vcx0,vcx1,ldots,vcxk of the Hamming cube 0,1nsubsetell1(n) has generalized roundness one if and only if the vectors vcx1vcx0,vcx2vcx0,ldots,vcxkvcx0 are linearly dependent in mathbbRn. Equivalently, S has strict 1-negative type if and only if the vectors vcx1vcx0,vcx2vcx0,ldots,vcxkvcx0 are linearly independent in mathbbRn.


Full work available at URL: https://arxiv.org/abs/1112.5657




Recommendations




Cites Work


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)