Related papers: Random perfect lattices and the sphere packing pro…
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…
Although the concept of random close packing with an almost universal packing fraction of ~ 0.64 for hard spheres was introduced more than half a century ago, there are still ongoing debates. The main difficulty in searching the densest…
We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable…
We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…
In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic…
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…
We generate and study an ensemble of isostatic jammed hard-sphere lattices. These lattices are obtained by compression of a periodic system with an adaptive unit cell containing a single sphere until the point of mechanical stability. We…
We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
Dense, disordered packings of particles are useful models of low-temperature amorphous phases of matter, biological systems, granular media, and colloidal systems. The study of dense packings of nonspherical particles enables one to…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
Atoms deeply trapped in magic wavelength optical lattices provide a Doppler- and collision-free dense ensemble of quantum emitters ideal for high precision spectroscopy. Thus, they are the basis of some of the best optical clock setups to…
In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translations under a…
Perfect fluid spheres, both Newtonian and relativistic, have attracted considerable attention as the first step in developing realistic stellar models (or models for fluid planets). Whereas there have been some early hints on how one might…
We propose an approach to statistical systems on lattices with sphere-like topology. Focusing on the Ising model, we consider the thermodynamic limit along a sequence of lattices which preserve the {\em fixed} large scale geometry. The…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
We write exact equations for the thermodynamic properties of a linear polymer molecule confined to walk on a lattice of finite size. The dimension of the space in which the lattice resides can be arbitrary. We also calculate polymer…