Related papers: Density bounds for unit ball packings relative to …

We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…

After the investigation of the congruent and non-congruent hyperball packings related to doubly truncated Coxeter orthoscheme tilings \cite{SzJ1}, we consider the corresponding covering problems. In \cite{MSSz} the authors gave a partial…

Let $X$ be a convex co-compact hyperbolic surface and let $\delta$ be the Hausdorff dimension of the limit set of the underlying discrete group. We show that the density of the resonances of the Laplacian in strips ${\sigma\leq \re(s) \leq…

Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect,…

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…

This paper shows that the self-concordance parameter of the universal barrier on any $n$-dimensional proper convex domain is upper bounded by $n$. This bound is tight and improves the previous $O(n)$ bound by Nesterov and Nemirovski. The…

We establish concentration inequalities in the class of ultra log-concave distributions. In particular, we show that ultra log-concave distributions satisfy Poisson concentration bounds. As an application, we derive concentration bounds for…

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

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,…

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…

We study the regularity of optimal transport maps between convex domains with quadratic cost. For nondegenerate $C^{\alpha}$-densities, we prove $C^{1, 1-\varepsilon}$-regularity of the potentials up to the boundary. If in addition the…

Let $\| \cdot \|$ be the euclidean norm on ${\bf R}^n$ and $\gamma_n$ the (standard) Gaussian measure on ${\bf R}^n$ with density $(2 \pi )^{-n/2} e^{- \| x\|^2 /2}$. Let $\vartheta$ ($ \simeq 1.3489795$) be defined by $\gamma_1 ([ -…

Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis,…

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

In a domain of the Euclidean space, we estimate from below the distance to the boundary of global maximum points of solutions of elliptic and parabolic equations with homogeneous Dirichlet boundary values. As reference cases, we first…

In this note we establish the existence of a new type of rigidity of symplectic embeddings coming from obligatory intersections with symplectic planes. More precisely, we prove that if a Euclidean ball is symplectically embedded in the…