Fundamental polytopes of metric trees via parallel connections of matroids
From MaRDI portal
(Redirected from Publication:2178668)
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.
Recommendations
- Classification of finite metric spaces and combinatorics of convex polytopes
- Finite homogeneous metric spaces
- Networklike metric spaces
- Combinatorics of the Lipschitz polytope
- On minimum spanning tree-like metric spaces
- The tight span of an antipodal metric space. I: combinatorial properties
- Compactness and measures of noncompactness in metric trees
- The real tree
- About some properties of similarly homogeneous \(\mathbb{R} \)-trees
- The tight span of an antipodal metric space. II: Geometrical properties
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A canonical decomposition theory for metrics on a finite set
- A geometric study of the split decomposition
- A note on the metric properties of trees
- Arithmetic aspects of symmetric edge polytopes
- Average range of Lipschitz functions on trees
- Classification of finite metric spaces and combinatorics of convex polytopes
- Classification of six-point metrics
- Combinatorial simpliciality of arrangements of hyperplanes
- Combinatorics of the Lipschitz polytope
- Cyclohedron and Kantorovich-Rubinstein polytopes
- Discrete Convex Analysis
- Lectures on Polytopes
- Linearly rigid metric spaces and the embedding problem
- Matroids from hypersimplex splits
- Normal polytopes arising from finite graphs
- Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles
- Root polytopes and abelian ideals
- Splitting Polytopes
- The Buneman index via polyhedral split decomposition
- Tropical convexity
- Tutte polynomials of generalized parallel connections
- Weighted digraphs and tropical cones
Cited in
(16)- Networklike metric spaces
- Combinatorics of the Lipschitz polytope
- The tight span of an antipodal metric space. II: Geometrical properties
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes
- Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles
- Voronoi diagrams of algebraic varieties under polyhedral norms
- Mini-workshop: Positivity and inequalities in convex and complex geometry. Abstracts from the mini-workshop held October 29 -- November 3, 2023
- Many faces of symmetric edge polytopes
- Faces of directed edge polytopes
- Subdivisions of Hypersimplices: With a View Toward Finite Metric Spaces
- On minimum spanning tree-like metric spaces
- Facets and facet subgraphs of symmetric edge polytopes
- Faces of directed edge polytopes
- On the Gamma-Vector of Symmetric Edge Polytopes
- Polytopality of Simple Games
- Polyhedral combinatorics of bisectors
This page was built for publication: Fundamental polytopes of metric trees via parallel connections of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178668)