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 Hinrichs and Richer. It is not known if the conjecture holds for 3 < n < 298. The best upper bound for the number of subsets of smaller diameters a four-dimensional set can be partitioned into is nine. This estimate was given by Lassak in 1982. In this note we improve this estimate by one.
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 diameter. This also reduces the smallest dimension in which Borsuk's conjecture is known to be false. Other examples of two-distance sets with large Borsuk's numbers will be given.
In 1933, Borsuk made a conjecture that every $n$-dimensional bounded set can be divided into $n+1$ subsets of smaller diameter. Up to now, the problem is still open for $4\leq n\leq 63$. In this paper, we firstly discuss the Banach-Mazur distance between the $n$-dimensional cube and the $\ell_{p}$ ball $(1\leq p< 2)$, then we study the generalized Borsuk's partition problem in metric spaces and prove that all bounded sets $X$ in every four-dimensional $\ell_{p}$ space can be divided into $2^4$ subsets of smaller diameter.
The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk number of such a set S is the smallest value of m such that there is a k-fold cover of S with m sets of diameters less than d. In this paper we characterize the k-fold Borsuk numbers of sets in the Euclidean plane, give bounds for those of centrally symmetric sets, smooth bodies and convex bodies of constant width, and examine them for finite point sets in t…
Hujter and Lángi introduced the $k$-fold Borsuk number of a set $S$ in Euclidean $n$-space of diameter $d > 0$ as the smallest cardinality of a family $\mathcal F$ of subsets of $S$, of diameters strictly less than $d$, such that every point of $S$ belongs to at least $k$ members of $\mathcal F$. We investigate whether a $k$-fold Borsuk covering of a set $S$ in a finite dimensional real normed space can be extended to a completion of $S$. Furthermore, we determine the $k$-fold Borsuk number of sets in not angled normed planes, and give a partial characterization for sets in angled planes.
Let $f(d)$ be the smallest number so that every set in $R^d$ of diameter 1 can be partitioned into $f(d)$ sets of diameter smaller than 1. Borsuk's conjecture was that $f(d)\! =\!d\!+\!1$. We prove that $f(d)\! \ge\! (1.2)^{\sqrt d}$ for large~$d$.
In this article we encode Hadwiger's covering conjecture and Borsuk's partition conjecture into continuous functions defined on the spaces of convex bodies, propose a four-step program to approach them, and obtain some partial results.
Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present questions related to Borsuk's problem.
In this work, the classical Borsuk conjecture is discussed, which states that any set of diameter 1 in the Euclidean space $ {\mathbb R}^d $ can be divided into $ d+1 $ parts of smaller diameter. During the last two decades, many counterexamples to the conjecture have been proposed in high dimensions. However, all of them are sets of diameter 1 that lie on spheres whose radii are close to the value $ {1}{\sqrt{2}} $. The main result of this paper is as follows: {\it for any $ r > {1}{2} $, there exists a $ d_0 $ such that for all $ d \ge d_0 $, a counterexample to Borsuk's conjecture can be fo…
In this work we survey four classic problems: Borsuk's partition problem, Tarski's plank problem, the Kneser--Poulsen problem on the monotonicity of the union of balls under a contraction of their centers, and the Hadwiger--Levi problem on covering convex bodies by their smaller positively homothetic copies.
In 2013 Andriy V. Bondarenko showed how to construct a two-distance counterexample to Borsuk's conjecture from any strongly regular graph whose vertex set is not the union of at most $f+1$ cliques (sets of pairwise adjacent vertices) where $f$ is the multiplicity of the second-largest eigenvalue of its adjacency matrix. He applied that construction to those two graphs that he had been able to prove to fulfill the condition: From the $G_2(4)$ graph (on 416 vertices) he got a 65-dimensional two-distance counterexample. From the $Fi_{23}$ graph (on 31671 vertices) he got a 782-dimensional one and…
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 $k$ subsets of any planar set of unit diameter. In order to find an upper estimate of the minimal diameter we propose an algorithm for finding sub-optimal partitions. In the cases $10 \leqslant k \leqslant 17$ some upper and lower estimates of the minimal diameter are improved. Another result is that any set $M \subset \mathbb{R}^3$ of a unit diameter can b…
For each positive integer $m$ and each real finite dimensional Banach space $X$, we set $β(X,m)$ to be the infimum of $δ\in (0,1]$ such that each set $A\subset X$ having diameter $1$ can be represented as the union of $m$ subsets of $A$ whose diameters are at most $δ$. Elementary properties of $β(X,m)$, including its stability with respect to $X$ in the sense of Banach-Mazur metric, are presented. Two methods for estimating $β(X,m)$ are introduced. The first one estimates $β(X,m)$ using the knowledge of $β(Y,m)$, where $Y$ is a Banach space sufficiently close to $X$. The second estimation uses…
We say a map f:X \to Y is an ε-embedding if it is continuous and the diameter of the fibres is less than ε. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is the smallest real number such that there exists an ε-embedding from X to a n-dimensional polyhedron. Surprisingly few estimations of these numbers can be found, and one of the aims of this paper is to present some. Following Gromov, we take the slightly different point of view by looking at the smallest dimension n for which there exists a ε-embedding to a polyhedron of dim…
Let $\mathcal{S}$ be a set of $n$ points in real four-dimensional space, no four coplanar and spanning the whole space. We prove that if the number of solids incident with exactly four points of $\mathcal{S}$ is less than $Kn^3$ for some $K=o(n^{\frac{1}{7}})$ then, for $n$ sufficiently large, all but at most $O(K)$ points of $\mathcal{S}$ are contained in the intersection of five linearly independent quadrics. Conversely, we prove that there are finite subgroups of size $n$ of an elliptic curve which span less than $\frac{1}{6}n^3$ solids containing exactly four points of $\mathcal{S}$.
Makeev proved that among centrally symmetric four-dimensional polytopes, with more than twenty facets and circumscribed about the Euclidean ball of diameter one, there is no universal cover for the family of unit diameter sets. In this paper we examine the converse problem, and prove that each centrally symmetric polytope, with at most fourteen facets and circumscribed about the Euclidean ball of diameter one, is a universal cover for the family of unit diameter sets.
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In this note we classify the $2$-distance sets in $\mathbb{R}^4$ up to isometry with computer-aided methods.
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present an $O(n^3)$ algorithm of constructing a 4-connected triangulation of $P$. Thus, our algorithm solves a longstanding open problem in computational geometry and geometric graph theory. We also provide a simple method for constructing a noncomplex triangulation of $P$ which requires $O(n^2)$ steps. This method provides a new insight to the structure of 4-connect…
We prove that if ${\mathcal E} \subset {\Bbb R}^{2d}$, $d \ge 2$, is an Ahlfors-David regular product set of sufficiently large Hausdorff dimension, denoted by $dim_{\mathcal H}({\mathcal E})$, and $ϕ$ is a sufficiently regular function, then the upper Minkowski dimension of the set $$ \{w \in {\mathcal E}: ϕ_l(w)=t_l; 1 \leq l \leq m \}$$ does not exceed $dim_{\mathcal H}({\mathcal E})-m$, in line with the regular value theorem from the elementary differential geometry. Our arguments are based on the mapping properties of the underlying Fourier Integral Operators and are intimately connected …
