Exact Constructions of a Family of Dense Periodic Packings of Tetrahedra

The determination of the densest packings of regular tetrahedra (one of the five Platonic solids) is attracting great attention as evidenced by the rapid pace at which packing records are being broken and the fascinating packing structures that have emerged. Here we provide the most general analytical formulation to date to construct dense periodic packings of tetrahedra with four particles per fundamental cell. This analysis results in six-parameter family of dense tetrahedron packings that includes as special cases recently discovered "dimer" packings of tetrahedra, including the densest known packings with density $\phi= 4000/4671 = 0.856347...$. This study strongly suggests that the latter set of packings are the densest among all packings with a four-particle basis. Whether they are the densest packings of tetrahedra among all packings is an open question, but we offer remarks about this issue. Moreover, we describe a procedure that provides estimates of upper bounds on the maximal density of tetrahedron packings, which could aid in assessing the packing efficiency of candidate dense packings.Comment: It contains 25 pages, 5 figures

Approximate symmetry reduction approach: infinite series reductions to the KdV-Burgers equation

For weak dispersion and weak dissipation cases, the (1+1)-dimensional KdV-Burgers equation is investigated in terms of approximate symmetry reduction approach. The formal coherence of similarity reduction solutions and similarity reduction equations of different orders enables series reduction solutions. For weak dissipation case, zero-order similarity solutions satisfy the Painlev\'e II, Painlev\'e I and Jacobi elliptic function equations. For weak dispersion case, zero-order similarity solutions are in the form of Kummer, Airy and hyperbolic tangent functions. Higher order similarity solutions can be obtained by solving linear ordinary differential equations.Comment: 14 pages. The original model (1) in previous version is generalized to a more extensive form and the incorrect equations (35) and (36) in previous version are correcte

Modeling Heterogeneous Materials via Two-Point Correlation Functions: II. Algorithmic Details and Applications

In the first part of this series of two papers, we proposed a theoretical formalism that enables one to model and categorize heterogeneous materials (media) via two-point correlation functions S2 and introduced an efficient heterogeneous-medium (re)construction algorithm called the "lattice-point" algorithm. Here we discuss the algorithmic details of the lattice-point procedure and an algorithm modification using surface optimization to further speed up the (re)construction process. The importance of the error tolerance, which indicates to what accuracy the media are (re)constructed, is also emphasized and discussed. We apply the algorithm to generate three-dimensional digitized realizations of a Fontainebleau sandstone and a boron carbide/aluminum composite from the two- dimensional tomographic images of their slices through the materials. To ascertain whether the information contained in S2 is sufficient to capture the salient structural features, we compute the two-point cluster functions of the media, which are superior signatures of the micro-structure because they incorporate the connectedness information. We also study the reconstruction of a binary laser-speckle pattern in two dimensions, in which the algorithm fails to reproduce the pattern accurately. We conclude that in general reconstructions using S2 only work well for heterogeneous materials with single-scale structures. However, two-point information via S2 is not sufficient to accurately model multi-scale media. Moreover, we construct realizations of hypothetical materials with desired structural characteristics obtained by manipulating their two-point correlation functions.Comment: 35 pages, 19 figure

Non-Universality of Density and Disorder in Jammed Sphere Packings

We show for the first time that collectively jammed disordered packings of three-dimensional monodisperse frictionless hard spheres can be produced and tuned using a novel numerical protocol with packing density $\phi$ as low as 0.6. This is well below the value of 0.64 associated with the maximally random jammed state and entirely unrelated to the ill-defined ``random loose packing'' state density. Specifically, collectively jammed packings are generated with a very narrow distribution centered at any density $\phi$ over a wide density range $\phi \in [0.6,~0.74048\ldots]$ with variable disorder. Our results support the view that there is no universal jamming point that is distinguishable based on the packing density and frequency of occurence. Our jammed packings are mapped onto a density-order-metric plane, which provides a broader characterization of packings than density alone. Other packing characteristics, such as the pair correlation function, average contact number and fraction of rattlers are quantified and discussed.Comment: 19 pages, 4 figure

Fourier law in the alternate mass hard-core potential chain

We study energy transport in a one-dimensional model of elastically colliding particles with alternate masses $m$ and $M$. In order to prevent total momentum conservation we confine particles with mass $M$ inside a cell of finite size. We provide convincing numerical evidence for the validity of Fourier law of heat conduction in spite of the lack of exponential dynamical instability. Comparison with previous results on similar models shows the relevance of the role played by total momentum conservation.Comment: 4 Revtex pages, 7 EPS figures include