Related papers: A note on the pyjama problem
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…
We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…
A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings…
A randomized scheme that succeeds with probability $1-\delta$ (for any $\delta>0$) has been devised to construct (1) an equidistributed $\epsilon$-cover of a compact Riemannian symmetric space $\mathbb M$ of dimension $d_{\mathbb M}$ and…
In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that…
This note treats several problems for the fractional perimeter or $s$-perimeter on the sphere. The spherical fractional isoperimetric inequality is established. It turns out that the equality cases are exactly the spherical caps.…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
We consider the problem of mirror invisibility for plane sets. Given a circle and a finite number of unit vectors (defining the directions of invisibility) such that the angles between them are commensurable with $\pi$, for any $\varepsilon…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
Answering a question of Wilf, we show that if $n$ is sufficiently large, then one cannot cover an $n \times p(n)$ rectangle using each of the $p(n)$ distinct Ferrers shapes of size $n$ exactly once. Moreover, the maximum number of pairwise…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
This paper is devoted to the study of periodic solutions for a radially symmetric semilinear wave equation in an $n$-dimensional ball. By combining the variational methods and saddle point reduction technique, we prove there exist at least…
We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…
This article studies the N-vortex problem in the plane with positive vorticities. After an investigation of some properties for normalised relative equilibria of the system, we use symplectic capacity theory to show that, there exist…
We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an $\varepsilon$-approximate solution is PPA-complete for both problems, while finding an exact…
Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of…
We study the soap film capillarity problem, in which soap films are modeled as sets of least perimeter among those having prescribed (small) volume and satisfying a topological spanning condition. When the given boundary is the closed…