Related papers: A counterexample to a conjecture of Larman and Rog…

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…

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

The Kneser-Poulsen conjecture says that if a finite collection of balls in a Euclidean (spherical or hyperbolic) space is rearranged so that the distance between each pair of centers does not increase, then the volume of the union of these…

The Kneser-Poulsen conjecture says that if a finite collection of balls in a d-dimensional Euclidean space is rearranged so that the distance between each pair of centers does not get smaller, then the volume of the union of these balls…

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…

We have discovered a "little" gap in our proof of the sharp conjecture that in $\mathbb{R}^n$ with volume and perimeter densities $r^m$ and $r^k$, balls about the origin are uniquely isoperimetric if $0 < m \leq k - k/(n+k-1)$, that is, if…

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

We consider the problem of estimating the distance between two bodies of volume $\varepsilon$ located inside a $n$-dimensional ball $U$ of unit volume for $n\to\infty$. Let $A$ be a closed set with a smooth boundary of the volume…

A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…

In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…

In this paper we shall give a short proof of the result originally obtained by Ashutosh Kumar that for each $A\subset \mathbb{R}$ there exists $B\subset A$ full in $A$ such that no distance between two distinct points from $B$ is rational.…

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 this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…

We give a proof of the $A_2$ conjecture in geometrically doubling metric spaces (GDMS), i.e. a metric space where one can fit not more than a fixed amount of disjoint balls of radius $r$ in a ball of radius $2r$. Our proof consists of three…

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.…

We prove the macroscopic cousins of three conjectures: 1) a conjectural bound of the simplicial volume of a Riemannian manifold in the presence of a lower scalar curvature bound, 2) the conjecture that rationally essential manifolds do not…

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…