English
Related papers

Related papers: Lower bounds for sphere packing in arbitrary norms

200 papers

We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…

Statistical Mechanics · Physics 2012-01-05 Saulo D. S. Reis , Nuno A. M. Araújo , José S. Andrade , Hans J. Herrmann

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…

Statistical Mechanics · Physics 2009-11-13 A. Scardicchio , F. H. Stillinger , S. Torquato

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…

Metric Geometry · Mathematics 2018-02-12 Karoly Bezdek

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

Metric Geometry · Mathematics 2015-10-12 Márton Naszódi

I prove a scalar curvature rigidity theorem for spheres. In particular, I prove that geodesic balls of radii strictly less than $\frac{\pi}{2}$ in $n+1~(n\geq 2)$ dimensional unit sphere can be rigid under smooth deformations that increase…

Differential Geometry · Mathematics 2025-12-30 Puskar Mondal

Let $N$ balls of the same radius be given in a $d$-dimensional real normed vector space, i.e., in a Minkowski $d$-space. Then apply a uniform contraction to the centers of the $N$ balls without changing the common radius. Here a uniform…

Metric Geometry · Mathematics 2020-05-12 Károly Bezdek

In $n$-dimensional hyperbolic space $\mathbf{H}^n$ $(n\ge2)$ there are $3$-types of spheres (balls): the sphere, horosphere and hypersphere. If $n=2,3$ we know an universal upper bound of the ball packing densities, where each ball volume…

Metric Geometry · Mathematics 2016-12-15 Emil Molnár , Jenő Szirmai

Our main contribution is a concentration inequality for the symmetric volume difference of a $ C^2 $ convex body with positive Gaussian curvature and a circumscribed random polytope with a restricted number of facets, for any probability…

Metric Geometry · Mathematics 2020-03-02 Steven Hoehner , Gil Kur

We prove that the second nontrivial Neumann eigenvalue of the Laplace-Beltrami operator on the unit sphere $\mathbb{S}^n \subseteq \mathbb{R}^{n+1}$ is maximized by the union of two disjoint, equal, geodesic balls among all subsets of…

Analysis of PDEs · Mathematics 2022-08-25 Dorin Bucur , Eloi Martinet , Mickaël Nahon

We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…

Metric Geometry · Mathematics 2022-01-24 Alexander E. Litvak , Galyna V. Livshyts

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

The volume of the unit ball of the Lebesgue sequence space $\ell_p^m$ is very well known since the times of Dirichlet. We calculate the volume of the unit ball in the mixed norm $\ell^n_q(\ell_p^m)$, whose special cases are nowadays popular…

Functional Analysis · Mathematics 2015-06-26 Henning Kempka , Jan Vybíral

We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known…

Metric Geometry · Mathematics 2022-06-07 Thomas Fernique

In hyperbolic space density cannot be defined by a limit as we define it in Euclidean space. We describe the local density bounds for sphere packings and we discuss the different attempts to define optimal arrangements in hyperbolic space.

Metric Geometry · Mathematics 2022-02-23 Gábor Fejes Tóth , Lázló Fejes Tóth , Włodzimierz. Kuperberg

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

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

Metric Geometry · Mathematics 2012-03-15 Henry Cohn , Noam Elkies

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

Probability · Mathematics 2017-04-07 Victor-Emmanuel Brunel

After having investigated the regular prisms and prism tilings in the $\SLR$ space in the previous work \cite{Sz13-1} of the second author, we consider the problem of geodesic ball packings related to those tilings and their symmetry groups…

Metric Geometry · Mathematics 2013-10-25 Emil Molnár , Jenö Szirmai

We prove that a region in a two-dimensional affine subspace of a normed space $V$ has the least 2-dimensional Hausdorff measure among all compact surfaces with the same boundary. Furthermore, the 2-dimensional Hausdorff area density admits…

Metric Geometry · Mathematics 2013-11-28 Dmitri Burago , Sergei Ivanov

In 1967, Gr\"unmbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. This conjecture along with the…

Combinatorics · Mathematics 2022-07-29 Lei Xue