• Corpus ID: 233296608

# Homothetic covering of convex hulls of compact convex sets

@article{Wu2021HomotheticCO,
title={Homothetic covering of convex hulls of compact convex sets},
author={Senlin Wu and Keke Zhang and Chan He},
journal={Contributions Discret. Math.},
year={2021},
volume={17},
pages={31-37}
}
• Published 18 April 2021
• Mathematics
• Contributions Discret. Math.
Abstract. Let K be a compact convex set and m be a positive integer. The convering functional of K with respect to m is the smallest λ ∈ [0, 1] such that K can be covered by m translates of λK. Estimations of the covering functionals of convex hulls of two or more compact convex sets are presented. It is proved that, if a three-dimensional convex body K is the convex hull of two compact convex sets having no interior points, then the least number c(K) of smaller homothetic copies of K needed to…

## References

SHOWING 1-10 OF 24 REFERENCES

### Covering functionals of cones and double cones

• Mathematics
Journal of inequalities and applications
• 2018
The least positive number γ such that a convex body K can be covered by m translates of γK is called the covering functional of K (with respect to m), and it is denoted by Γm(K)$\Gamma_{m}(K)$.

### Covering a convex body vs. covering the set of its extreme points

• Mathematics
• 2020
For a convex body K and two positive integers m and l satisfying $$m\le l$$ m ≤ l , we provide a way to dominate the smallest positive number $$\gamma _1$$ γ 1 such that K can be covered by m

### THE PROBLEM OF ILLUMINATION OF THE BOUNDARY OF A CONVEX BODY BY AFFINE SUBSPACES

The main result of this paper is the following theorem. If P is a convex polytope of E d with affine symmetry, then P can be illuminated by eight (d - 3)-dimensional affine subspaces (two (d-

### Excursions into Combinatorial Geometry

• Mathematics
• 1996
The book deals with the combinatorial geometry of convex bodies in finite-dimensional spaces. A general introduction to geometric convexity is followed by the investigation of d-convexity and

### Combinatorial problems on the illumination of convex bodies

• Mathematics
• 1999
Summary. This is a review of various problems and results on the illumination of convex bodies in the spirit of combinatorial geometry. The topics under review are: history of the

### The geometry of homothetic covering and illumination

• Mathematics
• 2016
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

### A quantitative program for Hadwiger’s covering conjecture

In 1957, Hadwiger made a conjecture that every n-dimensional convex body can be covered by 2n translates of its interior. Up to now, this conjecture is still open for all n ⩾ 3. In 1933, Borsuk made

### Covering functionals of convex polytopes

• Mathematics
Linear Algebra and its Applications
• 2019