On 1 embeddings of finite metric spaces, and sphere-of-influence graphs
Abstract
We introduce the pair-cut cone PCUTn of metrics on sets with n 3 elements, that correspond to linear combinations with non-negative coefficients of the cut-metrics resulting from cuts that are pairs. Given a metric, we fully characterize membership in the pair-cut cone in terms of quantities computed from the metric directly. We also prove a new result by which a metric d that satisfies a system of inequalities, lies in the (full) cut cone of metrics, making it 1-embeddable into Euclidean space. We give applications of our results to the 1-embeddability of simple graphs into Euclidean space as sphere-of-influence graphs. We exhibit an example of a simple graph that admits no such 1-metric in the pair-cut cone.
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.