Speaker
Description
Random sequential adsorption (RSA) is a protocol to generate random packing in the following way:
-
a virtual particle position and orientation in case of anisotropic shapes is selected randomly inside the packing;
-
if the virtual particle does not intersect with any object on the plane, it is added to the packing. Otherwise, it is removed from the system and abandoned.
One of is's key feature is the observed algebraic time dependence of the asymptotic jamming coverage:
$\theta_{max} - \theta(t) ∼t^{-d}$ when $t \to \infty$. Recent, theoretical study of A. Baule suggests that the scaling exponent observed for objects placed on a one-dimensional line depends on their shape, contrary to the original conjecture and, remarkably, falls into two universality classes.
Here we check this experimentally using new algorithms that allow generating strictly saturated RSA packings for ellipses, spherocylinders and rectangles. Additionally, we also study other properties of obtained packing.
