Related papers: On the covering index of convex bodies
We introduce the vertex index, vein(K), of a given centrally symmetric convex body K, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the…
Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…
The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety…
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…
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…
This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…
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…
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…
Let $K$ be a compact convex set and $m$ be a positive integer. The covering functional of $K$ with respect to $m$ is the smallest $\lambda\in[0,1]$ such that $K$ can be covered by $m$ translates of $\lambda K$. Estimations of the covering…
We present a survey article about the geometry of convex bodies on the $d$-dimensional sphere $S^d$. We concentrate on the results based on the notion of the width of a convex body $C \subset S^d$ determined by a supporting hemisphere of…
In geometry, there are several challenging problems studying numbers associated to convex bodies. For example, the packing density problem, the kissing number problem, the covering density problem, the packing-covering constant problem,…
We present a probabilistic model of illuminating a convex body by independently distributed light sources. In addition to recovering C.A. Rogers' upper bounds for the illumination number, we improve previous estimates of J. Januszewski and…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the…
Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C([a, b]^d, B)$, in the $L_p$-metric, $1…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…
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…
Motivated by previous efforts in detecting topological orders from the ground state(s) wave function, we introduce a new quantum information tool, coined the information convex, to capture the bulk and boundary topological excitations of a…