Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solution to Generalized Borsuk Problem in Terms of the Gromov-Hausdorff Distances to Simplexes (1906.10574v1)

Published 25 Jun 2019 in math.MG and math.FA

Abstract: In the present paper the following Generalized Borsuk Problem is studied: Can a given bounded metric space $X$ be partitioned into a given number $m$ (probably an infinite one) of subsets, each of which has a smaller diameter than $X$? We give a complete answer to this question in terms of the Gromov-Hausdorff distance from $X$ to a simplex of cardinality $m$ and having a diameter less than $X$. Here a simplex is a metric space, all whose non-zero distances are the same.

Summary

We haven't generated a summary for this paper yet.