Related papers: Borsuk's partition problem in four-dimensional $\e…
In 1933, K. Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? In 1965, V. G. Boltyanski and I. T. Gohberg made the following conjecture: Every bounded set in…
Borsuk conjectured that every n-dimensional bounded set of positive diameter can be partitioned into n+1 sets of smaller diameters. This conjecture was proved for n=2 by Borsuk, for n=3 first by Eggleston, and disproved for n > 297 by…
In 1933, Borsuk proposed the following problem: Can every bounded set in $\mathbb{E}^n$ be divided into $n+1$ subsets of smaller diameters? This problem has been studied by many authors, and a lot of partial results have been discovered. In…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…
In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…
The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\mathbb{R}^n$ is the smallest integer such that any set $F \subset \mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$,…
In 1933, Borsuk conjectured that any bounded d-dimensional set of nonzero diameter can be broken into d + 1 parts of smaller diameter. This conjecture was disproved for large enough d, though it is true for low dimensional cases. The paper…
The maximum of the Banach-Mazur distance $d_{BM}^M(X,\ell_\infty^n)$, where $X$ ranges over the set of all $n$-dimensional real Banach spaces, is difficult to compute. In fact, it is already not easy to get the maximum of…
In the papers Ziegler(2001) and Goldstein(2012) it was previously shown that any subset of the Boolean cube $ S \subset \{0,1\}^n $ for $ n \leq 9 $ can be partitioned into $n+1$ parts of smaller diameter, i.e., the Borsuk conjecture holds…
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…
Borsuk's conjecture states that any bounded set in R^n can be partitioned into n+1 sets of smaller diameter. It is known to be false for all n bigger or equal to 323. Here we show that Borsuk's conjecture fails in dimensions 321 and 322.…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…
In 1933, Karol Borsuk asked whether each bounded set in the $n$-dimensional Euclidean space can be divided into $n$+1 parts of smaller diameter. Because it would not make sense otherwise, one usually assumes that he just forgot to require…
Classical Borsuk problem asks about the minimal number of closed subsets of smaller diameter necessary to partition every compact in the Euclidean space. Topological version of the Borsuk problem is discussed.
In this paper we answer Larman's question on Borsuk's conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere in the dimension 65 which cannot be partitioned into 83 parts of smaller…
In 1993, Kahn and Kalai famously constructed a sequence of finite sets in $d$-dimensional Euclidean spaces that cannot be partitioned into less than $(1.203\ldots+o(1))^{\sqrt{d}}$ parts of smaller diameter. Their method works not only for…
The aim of this paper is to demonstrate relations between Gromov-Hausdorff distance properties and the Borsuk Conjecture. The Borsuk number of a given bounded metric space $X$ is the infimum of cardinal numbers $n$ such that $X$ can be…
Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…