Data mining for cones of metrics, quasi-metrics, hemi-metrics and super-metrics
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.