Data mining for cones of metrics, quasi-metrics, hemi-metrics and super-metrics
M. Deza, M. Dutour
Abstract
Using some adaptations of the adjacency decomposition method CR and the program cdd (~Fu), we compute the first computationally difficult cases of convex cones of m-ary and oriented analogs of semi-metrics and cut semi-metrics, which were introduced in DR2 and DP. We considered also more general notion of (m,s)-super-metric and corresponding cones. The data on related cones - the number of facets, of extreme rays, of their orbits and diameters - are collected in Table tab:MainLovelyTable. We study also criterion of adjacency for skeletons of those cones and their duals. Some families of extreme rays and operations on them are also given.
Create a lesson
Related papers
The Bézout inequality for mixed volumes characterizes simplices
Dylan Langharst, Shouda Wang
Affine dual Minkowski problem for general measures
Cheng Zhang, Hailin Jin
Algebraically independent distances and rigid metrics
Yoshito Ishiki
On the Geometry of Wasserstein Barycenter II: Riemannian Rigidity, Essential Non-Branching, and Finsler Models
Bang-Xian Han, Deng-Yu Liu
A Weak Topology on Metric Spaces
Armando W. Gutiérrez, Olavi Nevanlinna
Uncentered Blaschke-Santaló inequalities for the Gaussian measure
S. Artstein-Avidan, M. Fradelizi, K. Wyczesany