Related papers: On the Hadwiger covering problem in low dimensions

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

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…

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

In this paper, we introduce the notion of "geodesic cover" for Fuchsian groups, which summons copies of fundamental polygons in the hyperbolic plane to cover pairs of representatives realizing distances in the corresponding hyperbolic…

Let $H_d$ denote the smallest integer $n$ such that for every convex body $K$ in $\Re^d$ there is a $0<\lambda < 1$ such that $K$ is covered by $n$ translates of $\lambda K$. In the book \emph{Research problems in discrete geometry.} by…

This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.

Using ideas from the geometry of compression, we improve on the current upper and lower bounds of the Heilbronn triangle problem. In particular, let $\Delta(s)$ denote the minimal area of the triangle induced by $s$ points on a unit disk.…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…

This paper investigates the use of automatic continuity techniques in the context of valuations on convex bodies. We first provide an automatic continuity theorem for valuations restricted to parallelotopes with respect to a fixed basis.…

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…

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…

Given a convex $n$-gon $P$ and a positive integer $m$ such that $3\le m\le n-1$, let $Q$ denote the largest area convex $m$-gon contained in $P$. We are interested in the minimum value of $\Delta(Q)/\Delta(P)$, the ratio of the areas of…

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

In 1959, Erd\H{o}s and Moser asked for the maximum number of unit distances that may be formed among the vertices of a convex $n$-gon; until now, the best known upper bound has been $2\pi n \log_2 n + O(n)$, achieved by F\"uredi in 1990. In…

We obtain upper and lower bounds on the difference between the renormalized volume and the volume of the convex core of a convex cocompact hyperbolic 3-manifold which depend on the injectivity radius of the boundary of the universal cover…

If a hyperbolic 3-manifold admits an exceptional Dehn filling, then the length of the slope of that Dehn filling is known to be at most six. However, the bound of six appears to be sharp only in the toroidal case. In this paper, we…

A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ sides is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons,…

Efficient algorithms for convex optimization, such as the ellipsoid method, require an a priori bound on the radius of a ball around the origin guaranteed to contain an optimal solution if one exists. For linear and convex quadratic…