Minimal and Maximal Distances in Metric Spaces
Abstract
Given functions f,g: [n] → [n] do there exist n points A1,A2… An in some metric space such that Af(i),Ag(i) are the points closest and farthest from point Ai? In this paper we characterize precisely which pairs of functions have this property. If the metric space is Rk we show that the maximal number m(k) so that any pair of functions f,g: [m(k)]→ [m(k)] realizable in some metric space is also realizable in Rk grows exponentially in k. In the final section of this paper we consider what happens when we look at minimal and maximal distances separately. We show that any function g that can be a maximal distance function can also be a maximal distance function in R2. We also find an interesting family of functions that can be minimal distance functions but not in Rk.
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.