Random sequential adsorption of binary mixtures on a line.
A jamming coverage for the random sequential adsorption of binary mixtures of segments on the infinite line is derived. It always appears to be smaller than the coverage associated with the car parking problem. This has to be contrasted with dicrete models, where the coverage of the lattice by mixtures of segments of different sizes is more efficient than by single species.
Bonnier
B
B
CPMOH, UMR CNRS 5798, Université Bordeaux 1 351, cours de la Libération, 33405 Talence Cedex, France.