Related papers: Borsuk's Problem in Metric Spaces

Prompted by a recent question of G. Hjorth as to whether a bounded Urysohn space is indivisible, that is to say has the property that any partition into finitely many pieces has one piece which contains an isometric copy of the space, we…

We introduce the notion of tiling spaces for metric spaces. The class of tiling spaces contains the Euclidean spaces, the middle-third Cantor set, and various self-similar spaces appearing in fractal geometry. For doubling tiling spaces, we…

Thickenings of a metric space capture local geometric properties of the space. Here we exhibit applications of lower bounding the topology of thickenings of the circle and more generally the sphere. We explain interconnections with the…

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

We show that almost all natural numbers n not divisible by 4, and not congruent to 7 modulo 8, are represented as the sum of three squares, one of which is the square of an integer no larger than (log n)^{1+e} (any e>0). This answers a…

A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has…

In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…

Given an arbitrary set of high dimensional points in $\ell_1$, there are known negative results that preclude the possibility of always mapping them to a low dimensional $\ell_1$ space while preserving distances with small multiplicative…

Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…

In this survey we present a generalization of the notion of metric space and some applications to discrete structures as graphs, ordered sets and transition systems. Results in that direction started in the middle eighties based on the…

In the 1930's, Tarski introduced his plank problem at a time when the field discrete geometry was about to born. It is quite remarkable that Tarski's question and its variants continue to generate interest in the geometric as well as…

The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order $n$ whose metric subgraphs are all paths if and only…

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…

The aim of this paper is to provide the results that answer the Kuratowski problem posed in 1935 concerning the existence of nonmeasurable sets. The Kuratowski problem was considered for partitions, here we provide a generalization to…

We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as…

It is known that in $\mathbb{R}^n,n\geq 2$, a compact set which contains $n-1$ spheres with all radii in $[1/2,1]$ or with all possible centres in $[0,1]^n$ has full Hausdorff dimension. In fact the later set has positive Lebesgue measure.…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…