Classification of Finite Metric Spaces and Combinatorics of Convex Polytopes
Statement
Let be a finite metric space. Its fundamental polytope is the convex hull of the vectors for distinct ; its combinatorial structure is the isomorphism class of the face poset of . (1) Express this combinatorial structure, including the -vector, directly in terms of linear inequalities in the metric . (2) For , estimate the number of combinatorial structures and its asymptotic growth, especially the number of open (generic) types. (3) Give sufficient conditions for two finite metric spaces to have the same combinatorial structure. (4) Describe the combinatorial types of finite metric spaces that embed isometrically into a Euclidean or Hilbert space; do all combinatorial types occur? (5) Is the stratification of the cone of distance matrices into combinatorial types universal, or are there restrictions on the topological types of its open components?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.