English
Related papers

Related papers: Remarks on soft ball packings in dimensions 2 and …

200 papers

A centrally symmetric convex body is a convex compact set with non-empty interior that is symmetric about the origin. Of particular interest are those that are both smooth and strictly convex -- known here as regular symmetric bodies --…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

In this paper we consider ball packings in $4$-dimensional hyperbolic space. We show that it is possible to exceed the conjectured $4$-dimensional realizable packing density upper bound due to L. Fejes T\'oth (Regular Figures, 1964). We…

Metric Geometry · Mathematics 2014-08-25 Robert Thijs Kozma , Jenő Szirmai

We consider an optimal stretching problem for strictly convex domains in $\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$.…

Metric Geometry · Mathematics 2022-03-03 Nicholas F. Marshall

Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…

Computational Geometry · Computer Science 2015-05-14 Herbert Edelsbrunner , Mabel Iglesias-Ham , Vitaliy Kurlin

The notion of a completely saturated packing [Fejes Toth, Kuperberg and Kuperberg, Highly saturated packings and reduced coverings, Monats. Math. 125 (1998) 127-145] is a sharper version of maximum density, and the analogous notion of a…

Metric Geometry · Mathematics 2014-11-11 Greg Kuperberg

The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…

Statistical Mechanics · Physics 2015-05-18 A. B. Hopkins , F. H. Stillinger , S. Torquato

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…

Metric Geometry · Mathematics 2007-05-23 Ulrich Betke , Martin Henk

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

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

Mechanical metamaterials are structures designed to exhibit an exotic response, such as topological soft modes at a surface. Here we explore single-material 3D prints of these topological structures by translating a ball-and-spring model…

Soft Condensed Matter · Physics 2023-01-16 Achilles Bergne , Guido Baardink , Evripides G Loukaides , Anton Souslov

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…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and more recently for their applications in fields such as nanoscience, granular and colloidal matter, and biology. In all these fields, particle…

Soft Condensed Matter · Physics 2014-03-10 Elizabeth R. Chen , Daphne Klotsa , Michael Engel , Pablo F. Damasceno , Sharon C. Glotzer

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

The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…

Metric Geometry · Mathematics 2024-03-19 Jure Voglar , Aljoša Peperko

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…

Metric Geometry · Mathematics 2021-03-12 Miklós Eper , Jenő Szirmai

In this paper we study the locally optimal geodesic ball packings with equal balls to the $\mathbf{S}^2\!\times\!\mathbf{R}$ space groups having rotation point groups and their generators are screw motions. We determine and visualize the…

Metric Geometry · Mathematics 2014-07-07 Benedek Schultz , Jenő Szirmai

1) We present new lattice sphere packings in Euclid spaces of many dimensions in the range 3332-4096, which are denser than known densest Mrodell-Weil lattice sphere packings in these dimensions. Moreover it is proved that if there were…

Number Theory · Mathematics 2012-06-01 Hao Chen

An external load on a particle packing is distributed internally through a heterogeneous network of particle contacts. This contact force distribution determines the stability of the particle packing and the resulting structure. Here, we…

Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…

Statistical Mechanics · Physics 2014-05-02 Steven Atkinson , Yang Jiao , Salvatore Torquato

The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…

Computational Geometry · Computer Science 2014-01-03 Mabel Iglesias-Ham , Michael Kerber , Caroline Uhler