English
Related papers

Related papers: Lower bounds for sphere packing in arbitrary norms

200 papers

We show that for every large enough integer $N$, there exists an $N$-point subset of $L_1$ such that for every $D>1$, embedding it into $\ell_1^d$ with distortion $D$ requires dimension $d$ at least $N^{\Omega(1/D^2)}$, and that for every…

Metric Geometry · Mathematics 2011-12-22 Oded Regev

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

Combinatorics · Mathematics 2021-09-09 Pablo Soberón , Yuki Takahashi

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

Geometric Topology · Mathematics 2012-01-31 Bhaskar Bagchi , Basudeb Datta

We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special case when the feasible set is the unit (hyper)sphere. The…

Optimization and Control · Mathematics 2019-04-19 Etienne de Klerk , Monique Laurent

In this paper we prove that no packing of unit balls in Euclidean space $\mathbb{R}^8$ has density greater than that of the $E_8$-lattice packing.

Number Theory · Mathematics 2019-04-15 Maryna Viazovska

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Classical Analysis and ODEs · Mathematics 2026-04-21 Vjekoslav Kovač , Adian Anibal Santos Sepčić

We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…

Number Theory · Mathematics 2025-03-05 Felipe Gonçalves , Guilherme Vedana

We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…

Metric Geometry · Mathematics 2010-06-08 Konrad J. Swanepoel

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

We prove that if a topological sphere smoothly embedded into $\mathbb{R}^3$ with normal curvatures absolutely bounded by $1$ is contained in an open ball of radius $2$, then the region it bounds must contain a unit ball. This result…

Differential Geometry · Mathematics 2026-01-27 Hongda Qiu

It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…

Metric Geometry · Mathematics 2014-08-05 Yoav Kallus

We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…

Disordered Systems and Neural Networks · Physics 2013-12-17 Mauro Sellitto , Francesco Zamponi

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…

Disordered Systems and Neural Networks · Physics 2018-06-28 Thibaud Maimbourg , Mauro Sellitto , Guilhem Semerjian , Francesco Zamponi

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

Differential Geometry · Mathematics 2022-11-09 Robin Neumayer

We prove that the probability that a sum of independent random variables in $\mathbb{R}^d$ with bounded densities lies in a ball is maximized by taking uniform distributions on balls. This in turn generalizes a result by Rogozin on the…

Probability · Mathematics 2015-04-03 T. Juškevičius , J. D. Lee

We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…

Metric Geometry · Mathematics 2013-01-07 Robert Connelly , Jeffrey D. Shen , Alexander D. Smith

We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1}}$ and $\ell_{p_{2}}$ norm balls in finite dimensional Euclidean space for $1 \leq p_1 < p_2 \leq \infty$, and derive a closed-form formula…

Optimization and Control · Mathematics 2023-07-28 Shadi Haddad , Abhishek Halder

We bound several quantities related to the packing density of the patterns 1(L+1)L...2. These bounds sharpen results of B\'ona, Sagan, and Vatter and give a new proof of the packing density of these patterns, originally computed by…

Combinatorics · Mathematics 2007-05-23 Martin Hildebrand , Bruce E. Sagan , Vincent Vatter
‹ Prev 1 4 5 6 7 8 10 Next ›