Related papers: Pushing disks apart - The Kneser-Poulsen conjectur…
We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. In 1998, Sam Ferguson and I announced a computer-assisted proof of this…
We prove the following variant of the Falconer conjecture in the plane. If the dimension of a compact planar set is greater than one, then the distance set with respect to almost every ellipse has positive Lebesgue measure.
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…
We present an open problem about non-colliding freely moving hard disks in the Euclidean plane, together with related positive and negative partial results. The open problem is stated in a non-degenerate form: velocities are required to be…
In the 1960s Moser asked how dense a subset of $\mathbb{R}^d$ can be if no pairs of points in the subset are exactly distance 1 apart. There has been a long line of work showing upper bounds on this density. One curious feature of dense…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…
The present paper - a continuation of our recent series of papers on Casimir friction for a pair of particles at low relative particle velocity - extends the analysis so as to include dense media. The situation becomes in this case more…
The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…
Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…
Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…
Pick $n$ points $Z_0,...,Z_{n-1}$ uniformly and independently at random in a compact convex set $H$ with non empty interior of the plane, and let $Q^n_H$ be the probability that the $Z_i$'s are the vertices of a convex polygon. Blaschke…
For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…
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…