English
Related papers

Related papers: Contact numbers for sphere packings

200 papers

In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.

Metric Geometry · Mathematics 2022-07-21 Chengfei Xie , Gennian Ge

In 1694, Gregory and Newton discussed the problem to determine the kissing number of a rigid material ball. This problem and its higher dimensional generalization have been studied by many mathematicians, including Minkowski, van der…

Metric Geometry · Mathematics 2025-01-14 Yiming Li , Chuanming Zong

A brief report on recent work on the sphere-packing problem.

Combinatorics · Mathematics 2007-07-16 N. J. A. Sloane

The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…

Soft Condensed Matter · Physics 2010-01-05 Robert S. Farr , Robert D. Groot

This review paper is devoted to the problems of sphere packings in 4 dimensions. The main goal is to find reasonable approaches for solutions to problems related to densest sphere packings in 4-dimensional Euclidean space. We consider two…

Metric Geometry · Mathematics 2018-06-26 Oleg R. Musin

Generalized contact bundles are odd dimensional analogues of generalized complex manifolds. They have been introduced recently and very little is known about them. In this paper we study their local structure. Specifically, we prove a local…

Differential Geometry · Mathematics 2019-02-11 Jonas Schnitzer , Luca Vitagliano

Polarizable particle systems, including charged colloids, polarizable ions, biomolecular assemblies, and soft nanomaterials, can exhibit contact electrostatic interactions that depart strongly from Coulomb behavior when dielectric mismatch…

Soft Condensed Matter · Physics 2026-05-13 Yanyu Duan , Zecheng Gan

We generalise the theories of cosymplectic, contact, and cocontact manifolds to the infinite-dimensional setting and calculate model examples of time-dependent and dissipative Hamiltonian systems.

Symplectic Geometry · Mathematics 2025-12-18 Fraser Aidan Kelvin Sanders

Static packings of perfectly rigid particles are investigated theoretically and numerically. The problem of finding the contact forces in such packings is formulated mathematically. Letting the values of the contact forces define a vector…

Materials Science · Physics 2009-11-10 Sean McNamara , Hans Herrmann

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

Symbolic and graphical tools, such as Mathematica, enable precise visualization and analysis of void spaces in sphere packings. In the cubic close packing (CCP, or face-centred cubic packing; FCC) arrangement these voids can be partitioned…

Computational Geometry · Computer Science 2025-08-19 Philip W. Kuchel

This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…

Soft Condensed Matter · Physics 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…

Optimization and Control · Mathematics 2019-11-07 Hans D. Mittelmann , Frank Vallentin

We prove, for a class of contact manifolds, that the universal cover of the group of contact diffeomorphisms carries a natural partial order. It leads to a new viewpoint on geometry and dynamics of contactomorphisms. It gives rise to…

Symplectic Geometry · Mathematics 2007-05-23 Yakov Eliashberg , Leonid Polterovich

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…

Combinatorics · Mathematics 2023-08-30 Matteo Gallet , Georg Grasegger , Niels Lubbes , Josef Schicho

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…

Probability · Mathematics 2019-01-25 Souvik Dhara , Johan S. H. van Leeuwaarden , Debankur Mukherjee

Contact Geometry is an odd dimensional analogue of Symplectic Geometry. This vague idea can actually be formalized in a rather precise way by means of a Symplectic-to-Contact Dictionary. The aim of this review paper is discussing the basic…

Differential Geometry · Mathematics 2026-02-02 Fabrizio Pugliese , Giovanni Sparano , Luca Vitagliano

We study static packings of frictionless and frictional spheres in three dimensions, obtained via molecular dynamics simulations, in which we vary particle hardness, friction coefficient, and coefficient of restitution. Although…

Soft Condensed Matter · Physics 2009-11-07 Leonardo E. Silbert , Deniz Ertas , Gary S. Grest , Thomas C. Halsey , Dov Levine

We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…

Combinatorics · Mathematics 2025-12-23 Søren Eilers , Rune Johansen , Rasmus Veber Rasmussen , Carsten Thomassen
‹ Prev 1 3 4 5 6 7 10 Next ›