Fundamental polytopes of metric trees via parallel connections of matroids

preprint2019arXivOpen access

Abstract

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and, for tree-like metrics, we study the combinatorics of its underlying matroid. We give explicit formulas for the face numbers of fundamental polytopes and Lipschitz polytopes of all tree-like metrics, and we characterize the metric trees for which the fundamental polytope is simplicial.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.