Random sequential covering of a one-dimensional lattice by $k$-mers

Abstract

In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts that increase coverage are accepted. The process continues indefinitely on an infinite substrate, and we analyze the dynamics of random sequential covering of $\mathbb{Z}$ using $k$-mers. We introduce a method that provides a comprehensive solution to the dynamics of this process. We derive explicit solutions for trimers, tetramers, and pentamers; we study numerically random sequential covering by longer polymers ($k>5$).

19 pages 4 figures

References in corpus (11)

• Universally optimal distribution of points on spheres
• Optimal Packings of Superballs
• Basic Understanding of Condensed Phases of Matter via Packing Models
• Reformulation of the Covering and Quantizer Problems as Ground States of Interacting Particles
• Complexity in surfaces of densest packings for families of polyhedra
• Topological data analysis and machine learning
• Large Deviations in One-Dimensional Random Sequential Adsorption
• A renewal approach to configurational entropy in one dimension
• Random Sequential Covering
• On the structure factor of jammed particle configurations on the one-dimensional lattice
• Dynamic Space Packing

Cited by in corpus (1)

• Dynamic Space Filling