We study the deposition of line segments on a two-dimensional square lattice. The estimates for the coverage at jamming obtained by Monte-Carlo simulations and by 7 th -order time-series expansion are successfully compared. The non-trivial limit of adsorption of infinitely long segments is studied, and the lattice coverage is consistently obtained using these two approaches.

No abstract

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.