Random sequential adsorption of particles with tetrahedral symmetry

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.

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented by G. Zhang [Phys. Rev. E 97, 043311 (2018)2470-004510.1103/PhysRevE.97.043311], where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. The highest mean packing density, 0.552814±0.000063, was observed for triangles of side lengths 0.63:1:1. Additionally, microstructural properties of such packings, kinetics of their growth, as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.