Related papers: On some covering problems in geometry
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…
We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…
In the first part of this paper, we develop the theory of anisotropic curvature measures for convex bodies in the Euclidean space. It is proved that any convex body whose boundary anisotropic curvature measure equals a linear combination of…
We consider a class of overdetermined problems in rotationally symmetric spaces, which reduce to the classical Serrin's overdetermined problem in the case of the Euclidean space. We prove some general integral identities for rotationally…
This paper gives a quantitative version of Thurston's hyperbolic Dehn surgery theorem. Applications include the first universal bounds on the number of non-hyperbolic Dehn fillings on a cusped hyperbolic 3-manifold, and estimates on the…
In the framework of shape constrained estimation, we review methods and works done in convex set estimation. These methods mostly build on stochastic and convex geometry, empirical process theory, functional analysis, linear programming,…
Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are…
We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…
We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…
We study necessary conditions on the geometry and the topology of domains in $\mathbb{R}^2$ that support a positive solution to a classical overdetermined elliptic problem. The ideas and tools we use come from constant mean curvature…
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.
Two different versions of an optical theorem for a scattering body embedded inside a lossy background medium are derived in this paper. The corresponding fundamental upper bounds on absorption are then obtained in closed form by elementary…
The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…
The Sphere Covering Inequality was introduced in \cite{GM} (\emph{Invent. Math.}, 2018) as a sharp geometric inequality that provides a lower bound for the total area of two distinct surfaces of Gaussian curvature 1. These surfaces are…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
Upper and lower bounds are derived for the Gaussian mean width of the intersection of a convex hull of $M$ points with an Euclidean ball of a given radius. The upper bound holds for any collection of extreme point bounded in Euclidean norm.…
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,…