pith. sign in

arxiv: cond-mat/9605038 · v1 · submitted 1996-05-07 · ❄️ cond-mat

Kinetics and Jamming Coverage in a Random Sequential Adsorption of Polymer Chains

classification ❄️ cond-mat
keywords coveragethetajammingadsorptionchainchainsgrowthlength
0
0 comments X
read the original abstract

Using a highly efficient Monte Carlo algorithm, we are able to study the growth of coverage in a random sequential adsorption (RSA) of self-avoiding walk (SAW) chains for up to 10^{12} time steps on a square lattice. For the first time, the true jamming coverage (theta_J) is found to decay with the chain length (N) with a power-law theta_J propto N^{-0.1}. The growth of the coverage to its jamming limit can be described by a power-law, theta(t) approx theta_J -c/t^y with an effective exponent y which depends on the chain length, i.e., y = 0.50 for N=4 to y = 0.07 for N=30 with y -> 0 in the asymptotic limit N -> infinity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.