<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Delucchi, Emanuele</dc:creator>
  <dc:creator>Hoessly, Linard</dc:creator>
  <dc:date>2020-03-25</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">We tackle the problem of a combinatorial classification of finite metric spaces  via their fundamental polytopes, as suggested by Vershik (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.- We characterize the metric trees for  which the fundamental polytope is simplicial.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://folia.unifr.ch/global/documents/308717</dc:identifier>
  <dc:identifier>https://folia.unifr.ch/documents/308717/files/del_fpm.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejc.2020.103098</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:source>European Journal of Combinatorics. - 2020, vol. 87, p. 103098</dc:source>
  <dc:subject>info:eu-repo/classification/udc/51</dc:subject>
  <dc:title xmlns:ns1="xml" ns1:lang="en">Fundamental polytopes of metric trees via parallel connections of matroids</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>
