Related papers: Spherical coverings and X-raying convex bodies of …
We show that there exist convex bodies of constant width in $\mathbb{E}^n$ with illumination number at least $(\cos(\pi/14)+o(1))^{-n}$, answering a question by G. Kalai. Furthermore, we prove the existence of finite sets of diameter $1$ in…
The illumination conjecture asserts that any convex body in $n$-dimensional Euclidean space can be illuminated by at most $2^n$ external light sources or parallel beams of light. Despite recent progress on the illumination conjecture, it…
The X-ray numbers of some classes of convex bodies are investigated. In particular, we give a proof of the X-ray Conjecture as well as of the Illumination Conjecture for almost smooth convex bodies of any dimension and for convex bodies of…
This thesis consists of five papers about reduced spherical convex bodies and in particular spherical bodies of constant width on the $d$-dimensional sphere $S^d$. In paper I we present some facts describing the shape of reduced bodies of…
If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…
In this paper, the following two theorems are proved: $(1)$ every spherical convex body $W$ of constant width $\Delta (W) \geq \frac{\pi}{2}$ may be covered by a disk of radius $\Delta(W) + \arcsin \left( \frac{2\sqrt{3}}{3} \cdot \cos…
It was conjectured by Levi, Hadwiger, Gohberg and Markus that the boundary of any convex body in ${\mathbb R}^n$ can be illuminated by at most $2^n$ light sources, and, moreover, $2^n-1$ light sources suffice unless the body is a…
Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…
Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…
A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…
A celebrated result of Beck shows that for any set of $N$ points on $\mathbb{S}^d$ there always exists a spherical cap $B \subset \mathbb{S}^d$ such that number of points in the cap deviates from the expected value $\sigma(B) \cdot N$ by at…
For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…
The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…