TY  - BOOK
AU  - Dutour Sikirić,Mathieu
AU  - Itoh,Yoshiaki
TI  - Random sequential packing of cubes
SN  - 9789814307840
AV  - QA166.7 .D88 2011eb
U1  - 511/.6 22
PY  - 2011///
CY  - New Jersey
PB  - World Scientific
KW  - Combinatorial packing and covering
KW  - Sphere packings
KW  - Pavage et remplissage (Géométrie combinatoire)
KW  - Empilements de sphères
KW  - MATHEMATICS
KW  - Combinatorics
KW  - bisacsh
KW  - fast
KW  - Electronic books
N1  - Includes bibliographical references and index; Preface; Contents; 1. Introduction; 2. The Flory model; 3. Random interval packing; 4. On the minimum of gaps generated by 1-dimensional random packing; 5. Integral equation method for the 1-dimensional random packing; 6. Random sequential bisection and its associated binary tree; 7. The unified Kakutani Renyi model; 8. Parking cars with spin but no length; 9. Random sequential packing simulations; 10. Discrete cube packings in the cube; 11. Discrete cube packings in the torus; 12. Continuous random cube packings in cube and torus; Appendix A Combinatorial Enumeration; Bibliography; Index
N2  - In this volume very simplified models are introduced to understand the random sequential packing models mathematically. The 1-dimensional model is sometimes called the Parking Problem, which is known by the pioneering works by Flory (1939), Renyi (1958), Dvoretzky and Robbins (1962). To obtain a 1-dimensional packing density, distribution of the minimum of gaps, etc., the classical analysis has to be studied. The packing density of the general multi-dimensional random sequential packing of cubes (hypercubes) makes a well-known unsolved problem. The experimental analysis is usually applied to
UR  - https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=373227
ER  -