scholarly journals A jamming plane of sphere packings

2021 ◽  
Vol 118 (14) ◽  
pp. e2021794118
Author(s):  
Yuliang Jin ◽  
Hajime Yoshino

The concept of jamming has attracted great research interest due to its broad relevance in soft-matter, such as liquids, glasses, colloids, foams, and granular materials, and its deep connection to sphere packing and optimization problems. Here, we show that the domain of amorphous jammed states of frictionless spheres can be significantly extended, from the well-known jamming-point at a fixed density, to a jamming-plane that spans the density and shear strain axes. We explore the jamming-plane, via athermal and thermal simulations of compression and shear jamming, with initial equilibrium configurations prepared by an efficient swap algorithm. The jamming-plane can be divided into reversible-jamming and irreversible-jamming regimes, based on the reversibility of the route from the initial configuration to jamming. Our results suggest that the irreversible-jamming behavior reflects an escape from the metastable glass basin to which the initial configuration belongs to or the absence of such basins. All jammed states, either compression- or shear-jammed, are isostatic and exhibit jamming criticality of the same universality class. However, the anisotropy of contact networks nontrivially depends on the jamming density and strain. Among all state points on the jamming-plane, the jamming-point is a unique one with the minimum jamming density and the maximum randomness. For crystalline packings, the jamming-plane shrinks into a single shear jamming-line that is independent of initial configurations. Our study paves the way for solving the long-standing random close-packing problem and provides a more complete framework to understand jamming.

1978 ◽  
Vol 30 (4) ◽  
pp. 738-747 ◽  
Author(s):  
David P. Maher

Several authors [2;3;10;12] have noticed the similarities between the theory of codes and the theory of Euclidean lattices. It is interesting to compare the two theories since they share a common problem, viz. the sphere packing problem. In the theory of codes one would like to find a code over Fp, i.e. a subspace of Fpn, such that non-intersecting spheres with respect to a given metric, centered at the code vectors, pack Fpndensely.


2007 ◽  
Vol 245 (1) ◽  
pp. 77-82 ◽  
Author(s):  
Luca Zammataro ◽  
Guido Serini ◽  
Todd Rowland ◽  
Federico Bussolino

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Marco Aurelio Sotelo-Figueroa ◽  
Héctor José Puga Soberanes ◽  
Juan Martín Carpio ◽  
Héctor J. Fraire Huacuja ◽  
Laura Cruz Reyes ◽  
...  

In recent years Grammatical Evolution (GE) has been used as a representation of Genetic Programming (GP) which has been applied to many optimization problems such as symbolic regression, classification, Boolean functions, constructed problems, and algorithmic problems. GE can use a diversity of searching strategies including Swarm Intelligence (SI). Particle Swarm Optimisation (PSO) is an algorithm of SI that has two main problems: premature convergence and poor diversity. Particle Evolutionary Swarm Optimization (PESO) is a recent and novel algorithm which is also part of SI. PESO uses two perturbations to avoid PSO’s problems. In this paper we propose using PESO and PSO in the frame of GE as strategies to generate heuristics that solve the Bin Packing Problem (BPP); it is possible however to apply this methodology to other kinds of problems using another Grammar designed for that problem. A comparison between PESO, PSO, and BPP’s heuristics is performed through the nonparametric Friedman test. The main contribution of this paper is proposing a Grammar to generate online and offline heuristics depending on the test instance trying to improve the heuristics generated by other grammars and humans; it also proposes a way to implement different algorithms as search strategies in GE like PESO to obtain better results than those obtained by PSO.


2009 ◽  
Vol 2009 ◽  
pp. 1-22 ◽  
Author(s):  
Mhand Hifi ◽  
Rym M'Hallah

This paper reviews the most relevant literature on efficient models and methods for packing circular objects/items into Euclidean plane regions where the objects/items and regions are either two- or three-dimensional. These packing problems are NP hard optimization problems with a wide variety of applications. They have been tackled using various approaches-based algorithms ranging from computer-aided optimality proofs, to branch-and-bound procedures, to constructive approaches, to multi-start nonconvex minimization, to billiard simulation, to multiphase heuristics, and metaheuristics.


2021 ◽  
Vol 118 (15) ◽  
pp. e2023227118
Author(s):  
Andrew Bakan ◽  
Haakan Hedenmalm ◽  
Alfonso Montes-Rodríguez ◽  
Danylo Radchenko ◽  
Maryna Viazovska

In recent work, methods from the theory of modular forms were used to obtain Fourier uniqueness results in several key dimensions (d=1,8,24), in which a function could be uniquely reconstructed from the values of it and its Fourier transform on a discrete set, with the striking application of resolving the sphere packing problem in dimensions d=8 and d=24. In this short note, we present an alternative approach to such results, viable in even dimensions, based instead on the uniqueness theory for the Klein–Gordon equation. Since the existing method for the Klein–Gordon uniqueness theory is based on the study of iterations of Gauss-type maps, this suggests a connection between the latter and methods involving modular forms. The derivation of Fourier uniqueness from the Klein–Gordon theory supplies conditions on the given test function for Fourier interpolation, which are hoped to be optimal or close to optimal.


2012 ◽  
Vol 2 (5) ◽  
pp. 589-601 ◽  
Author(s):  
Marianne Impéror-Clerc

Three-dimensional periodic complex structures are encountered in various soft matter systems such as liquid crystals, block-copolymer phases and the related nano-structured materials. Here, we review several well-defined topologies: two-dimensional hexagonal phase, three-dimensional packing of spheres, tetrahedral close packing ( tcp ) bi-continuous and tri-continuous cubic phases. We illustrate how small-angle X-ray scattering experiments help us to investigate these different structures and introduce the main available structural models based on both direct and inverse methods.


2012 ◽  
Vol 23 (9) ◽  
pp. 2285-2296
Author(s):  
Liang YU ◽  
Wen-Qi HUANG

Sign in / Sign up

Export Citation Format

Share Document