English
Related papers

Related papers: In a search for a shape maximizing packing fractio…

200 papers

Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…

Computational Physics · Physics 2019-11-25 Michał Cieśla

Kinetics of random sequential adsorption (RSA) of spheres on flat, two-dimensional surfaces is governed by a power law with exponent $-1/2$. The study has shown that for RSA of nearly spherically symmetric particles this exponent is $-1/3$,…

Materials Science · Physics 2014-03-14 Michał Cieśla , Jakub Barbasz

The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…

Soft Condensed Matter · Physics 2014-09-15 Ping Wang , Chaoming Song , Yuliang Jin , Hernan A. Makse

Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Here we consider jammed states of the RSA process of nonoverlapping dimers (objects occupying two…

Statistical Mechanics · Physics 2022-04-15 Zbigniew Koza , Grzegorz Kondrat

In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues…

Statistical Mechanics · Physics 2024-11-04 Tomislav Došlić , Mate Puljiz , Stjepan Šebek , Josip Žubrinić

In the paper, packings built of identical cuboids with a square base created by random sequential adsorption are studied. The result of the study show that the packing of the highest density are obtained for oblate and prolate cuboids of…

Materials Science · Physics 2018-08-01 Piotr Kubala , Michał Cieśla

Restricted-valence random sequential adsorption~(RSA) is studied in its pure and disordered versions, on the square and triangular lattices. For the simplest case~(pure on the square lattice) we prove the absence of percolation for maximum…

Statistical Mechanics · Physics 2020-10-14 A. P. Furlan , Diogo C. dos Santos , Robert M. Ziff , Ronald Dickman

The random sequential adsorption (RSA) model has served as a paradigm for diverse phenomena in physical chemistry, as well as in other areas such as biology, ecology, and sociology. In the present work, we survey aspects of the RSA model…

Statistical Mechanics · Physics 2010-09-22 A. Cadilhe , N. A. M. Araujo , Vladimir Privman

We introduce a generalization of the well-known random sequential addition (RSA) process for hard spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$. We show that all of the $n$-particle correlation functions of this nonequilibrium…

Soft Condensed Matter · Physics 2009-11-11 S. Torquato , F. H. Stillinger

We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…

Soft Condensed Matter · Physics 2015-06-04 A. Mughal , H. K. Chan , D. Weaire , S. Hutzler

We consider the non-overlapping irreversible random sequential adsorption (RSA) process on one-dimensional finite line, which is known also as the car parking process. The probability of each coverage in saturating states is analytically…

Statistical Mechanics · Physics 2008-12-03 Masatomo Iwasa , Kyohei Fukuda

We study the kinetics of competitive random sequential adsorption (RSA) of particles of binary mixture of points and fixed-sized particles within the mean-field approach. The present work is a generalization of the random car parking…

Statistical Mechanics · Physics 2016-08-31 M. K. Hassan , J. Kurths

Employing numerical and theoretical methods, we investigate the structural characteristics of random sequential addition (RSA) of congruent spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$ in the infinite-time or saturation limit…

Statistical Mechanics · Physics 2015-06-25 S. Torquato , O. U. Uche , F. H. Stillinger

The first theoretical study of a dimer's adsorption process at homogenous surface is presented. By using the RSA algorithm, we show example monolayers, discuss estimations of random jamming coverage and measure the surface blocking…

Materials Science · Physics 2012-05-18 Michal Ciesla , Jakub Barbasz

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

Statistical Mechanics · Physics 2009-11-13 Antonio Trovato , Trinh X. Hoang , Jayanth R. Banavar , Amos Maritan

The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…

Soft Condensed Matter · Physics 2010-01-05 Robert S. Farr , Robert D. Groot

Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…

A simple multiscale approach to the diffusion-driven adsorption from a solution to a solid surface is presented. The model combines two important features of the adsorption process: (i) the kinetics of the chemical reaction between…

Chemical Physics · Physics 2009-11-13 Radek Erban , S. Jonathan Chapman

The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…

Disordered Systems and Neural Networks · Physics 2020-07-14 Nikolai I. Lebovka , Mykhailo O. Tatochenko , Nikolai V. Vygornitskii , Yuri Yu. Tarasevich

In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used.…

Data Structures and Algorithms · Computer Science 2007-05-23 Xin Han , Kazuo Iwama , Guochuan Zhang