Related papers: A method for dense packing discovery
We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal…
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in $R^2$. With the benefit of hindsight, we show that the problem can be restricted to 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…
In earlier works \cite{Sz06-1}, \cite{Sz06-2}, \cite{Sz13-3} and \cite{Sz13-4} we have investigated the densest packings and the least dense coverings by congruent hyperballs (hyperspheres) to the regular prism tilings in $n$-dimensional…
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…
In this paper we study the problem of hyperball (hypersphere) packings in $3$-dimensional hyperbolic space. We introduce a new definition of the non-compact saturated ball packings and describe to each saturated hyperball packing, a new…
Irreversible random sequential deposition of interacting particles is widely used to model aggregation phenomena in physical, chemical, and biophysical systems. We show that in one dimension the exact time dependent solution of such…
In this paper, we use a straightforward numerical method to solve scattering models in one-dimensional lattices based on a tight-binding band structure. We do this by using the wave packet approach to scattering, which presents a more…
Automatic cell tracking in dense environments is plagued by inaccurate correspondences and misidentification of parent-offspring relationships. In this paper, we introduce a novel cell tracking algorithm named DenseTrack, which integrates…
The recently developed dynamic discretization discovery (DDD) is a powerful method that allows many time-dependent problems to become more tractable. While DDD has been applied to a variety of problems, one particular challenge has been to…
We construct a dense packing of regular tetrahedra, with packing density $D > >.7786157$.
Inspired by, and using methods of optimization derived from classical three dimensional electrostatics, we note a novel beautiful symmetric four dimensional polytope we have found with 80 vertices. We also describe how the method used to…
We present DisPerSE, a novel approach to the coherent multi-scale identification of all types of astrophysical structures, and in particular the filaments, in the large scale distribution of matter in the Universe. This method and…
Disordered hyperuniform dispersions are exotic amorphous two-phase materials characterized by an anomalous suppression of long-wavelength volume-fraction fluctuations, endowing them with novel physical properties. While such unusual…
Cutting and packing problems are present in many, at first glance unconnected, areas, therefore it's beneficial to have a good understanding of their underlying structure, to select proper techniques for finding solutions. Cutting and…
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly…
Many standard structural quantities, such as order parameters and correlation functions, exist for common condensed matter systems, such as spherical and rod-like particles. However, these structural quantities are often insufficient for…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…