Random sequential adsorption of cuboids

Optimal three-dimensional particle shapes for maximally dense saturated packing

Saturated packing is a random packing state of particles widely applied in investigating the physicochemical properties of granular materials. Optimizing particle shape to maximize packing density is a crucial challenge in saturated packing research. The known optimal three-dimensional shape is an ellipsoid with a saturated packing density of 0.437 72(51). In this work, we generate saturated packings of three-dimensional asymmetric shapes, including spherocylinders, cones, and tetrahedra, via the random sequential adsorption algorithm and investigate their packing properties. Results show that the optimal shape of asymmetric spherocylinders gives the maximum density of 0.4338(9), while cones achieve a higher value of 0.4398(10). Interestingly, tetrahedra exhibit two distinct optimal shapes with significantly high densities of 0.4789(19) and 0.4769(18), which surpass all previous results in saturated packing. The study of adsorption kinetics reveals that the two optimal shapes of tetrahedra demonstrate notably higher degrees of freedom and faster growth rates of the particle number. The analysis of packing structures via the density pair-correlation function shows that the two optimal shapes of tetrahedra possess faster transitions from local to global packing densities.

Algorithms to generate saturated random sequential adsorption packings built of rounded polygons

We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used in studying various properties of such packings built of a wide variety of different shapes, and in modeling monolayers obtained during irreversible adsorption processes of complex molecules. Here, we apply the algorithm to study the densities of packings built of rounded regular polygons. Contrary to packings built of regular polygons, where the packing fraction grows with an increasing number of polygon sides, here the packing fraction reaches its maximum for packings built of rounded regular triangles. With a growing number of polygon sides and increasing rounding radius, the packing fractions tend to the limit given by a packing built of disks. However, they are still slightly higher, even for the rounded 25-gon, which is the highest-sided regular polygon studied here.

Random sequential adsorption of lattice animals on a three-dimensional cubic lattice

The properties of the random sequential adsorption of objects of various shapes on simple three-dimensional (3D) cubic lattice are studied numerically by means of Monte Carlo simulations. Depositing objects are "lattice animals," made of a certain number of nearest-neighbor sites on a lattice. The aim of this work is to investigate the impact of the geometrical properties of the shapes on the jamming density θ_{J} and on the temporal evolution of the coverage fraction θ(t). We analyzed all lattice animals of size n=1, 2, 3, 4, and 5. A significant number of objects of size n⩾6 were also used to confirm our findings. Approach of the coverage θ(t) to the jamming limit θ_{J} is found to be exponential, θ_{J}-θ(t)∼exp(-t/σ), for all lattice animals. It was shown that the relaxation time σ increases with the number of different orientations m that lattice animals can take when placed on a cubic lattice. Orientations of the lattice animal deposited in two randomly chosen places on the lattice are different if one of them cannot be translated into the other. Our simulations performed for large collections of 3D objects confirmed that σ≅m∈{1,3,4,6,8,12,24}. The presented results suggest that there is no correlation between the number of possible orientations m of the object and the corresponding values of the jamming density θ_{J}. It was found that for sufficiently large objects, changing of the shape has considerably more influence on the jamming density than increasing of the object size.

Random sequential adsorption of particles with tetrahedral symmetry

We study random sequential adsorption (RSA) of a class of solids that can be obtained from a cube by specific cutting of its vertices, in order to find out how the transition from tetrahedral to octahedral symmetry affects the densities of the resulting jammed packings. We find that in general solids of octahedral symmetry form less dense packing; however, the lowest density was obtained for the packing built of tetrahedra. The densest packing is formed by a solid close to a tetrahedron but with vertices and edges slightly cut. Its density is θ_{max}=0.41278±0.00059 and is higher than the mean packing fraction of spheres or cuboids but is lower than that for the densest RSA packings built of ellipsoids or spherocylinders. The density autocorrelation function of the studied packings is typical for random media and vanishes very quickly with distance.

Random sequential adsorption of Platonic and Archimedean solids

The aim of this study is the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed that the highest saturated packing fraction θ=0.40210(68) is reached by packings build of truncated tetrahedra and the smallest one θ=0.35635(67) by packings composed of regular tetrahedra. The propagation of translational and orientational order exhibited microstructural properties typically seen in random sequential adsorption packings and the kinetics of three-dimensional packings growth were again observed not to be strictly connected with the dimension of the configuration space. Moreover, a fast overlap criterion for Platonic and Archimedean solids based on separating axis theorem has been described. The criterion, together with other optimizations, allowed us to generate significantly larger packings, which translated directly to a lower statistical error of the results obtained. Additionally, the polyhedral order parameters provided can be utilized in other studies regarding particles of polyhedral symmetry.