English

Matrix Invariants of Finite Metric Spaces

Combinatorics 2020-03-09 v1

Abstract

Finite metric spaces are characterized by a polyhedral cone defined in terms of the positivity of the distance functions and the triangle inequalities. Their classification is based on the decomposition of an associated polyhedral cone, called the "metric fan". The complete classification of nn-point metric spaces is available only for n6n\le 6. As the number of classes increases rapidly with the number of elements, it is desirable to have coarser equivalence class decompositions based on certain invariants of finite metric spaces. If (X,d)(X,d) is a finite metric space with elements PiP_i and with distance functions dijd_{ij}, the Gromov product at PiP_i is defined as Δijk=1/2(dij+dikdjk)\Delta_{ijk}=1/2(d_{ij}+d_{ik}-d_{jk}). Assuming that the set of Gromov product at PiP_i has a unique smallest element Δijk\Delta_{ijk}, the association of the edge PjPkP_jP_k to PiP_i defines the "Gromov product structure". The "pendant-free" reduction of the finite metric space is the graph obtained by removing the edges PjPkP_jP_k corresponding to the minimal Gromov products Δijk\Delta_{ijk} at PiP_i. In the present work, we define a matrix representation for a Gromov product structure SS on an nn-point metric space, by n×nn\times n matrix GSG_S. We prove that if two metric spaces have Gromov product structures that can be mapped to each other by a permutation of the indices, then their matrices are similar via the corresponding permutation matrix. Matrix invariants of GSG_S are used to define subclasses of Gromov product structures and their application to n=5n=5 and n=6n=6-point spaces are given.

Keywords

Cite

@article{arxiv.2003.03335,
  title  = {Matrix Invariants of Finite Metric Spaces},
  author = {Ayse Humeyra Bilge and Metehan Incegul},
  journal= {arXiv preprint arXiv:2003.03335},
  year   = {2020}
}