Preface |
Introduction / 1: |
The Flory model / 2: |
One-dimensional discrete random sequential packing / 2.1: |
Application of generating function / 2.2: |
Number of gaps / 2.3: |
Minimum of gaps / 2.4: |
Packing on circle and numerical study / 2.5: |
Appendix: Complex Analysis / 2.6: |
Random interval packing / 3: |
The probabilistic setup of the problem / 3.1: |
The solution of the delay differential equation using Laplace transform / 3.2: |
The computation of the limit / 3.3: |
Packing on circle and the speed of convergence / 3.4: |
Appendix: The Laplace transform / 3.5: |
On the minimum of gaps generated by 1-dimensional random packing / 4: |
Main properties of Pr(L(x) ? h) / 4.1: |
Laplace transform of Pr(L(x) ? h) / 4.2: |
Numerical calculations for a (h) / 4.3: |
Asymptotic analysis for a(h) / 4.4: |
Renewal equation technique / 4.4.1: |
Approximation for small 1 - h / 4.4.2: |
Approximation for small h / 4.4.3: |
Maximum of gaps / 4.5: |
Appendix: Renewal equations / 4.6: |
Integral equation method for the 1-dimensional random packing / 5: |
The variance and the central limit theorem / 5.1: |
Random sequential bisection and its associated binary tree / 6: |
Random sequential bisection / 6.1: |
Binary search tree / 6.2: |
Expected number of nodes at the d-th level / 6.3: |
Exponential distribution and uniform distribution / 6.4: |
Asymptotic size of the associated tree / 6.5: |
Asymptotic shape of the associated tree / 6.6: |
More on the associated tree / 6.7: |
The unified Kakutani Rényi model / 7: |
The limit random packing density / 7.1: |
Expectation and variance of number of cars for l = 0 / 7.2: |
The central limit theorem / 7.3: |
Almost sure convergence results / 7.4: |
The limit distribution of a randomly chosen gap / 7.5: |
Parking cars with spin but no length / 8: |
Integral equations / 8.1: |
Existence of the limit packing density / 8.2: |
Laplace transform and explicitly solvable cases / 8.3: |
General solution methods / 8.4: |
The power series solution / 8.5: |
Numerical computations / 8.6: |
Random sequential packing simulations / 9: |
Sequential random packing and the covering problem / 9.1: |
Random packing of spheres / 9.2: |
Random packing of cubes / 9.3: |
Random sequential coding by Hamming distance / 9.4: |
Frequency of getting Golay code by a random sequential packing / 9.5: |
Discrete cube packings in the cube / 10: |
Setting of a goal / 10.1: |
Reduction to another problem / 10.2: |
Proof of the theorem / 10.3: |
Discrete cube packings in the torus / 11: |
Algorithm for generating cube packings / 11.1: |
Non-extensible cube packings / 11.3: |
The second moment / 11.4: |
Appendix: Crystallographic groups / 11.5: |
Continuous random cube packings in cube and torus / 12: |
Combinatorial cube packings / 12.1: |
Discrete random cube packings of the cube / 12.3: |
Combinatorial torus cube packings and lamination construction / 12.4: |
Properties of non-extensible cube packings / 12.5: |
Combinatorial Enumeration / Appendix A: |
The isomorphism and automorphism problems / A.l: |
Sequential exhaustive enumeration / A.2: |
The homomorphism principle / A.3: |
Bibliography |
Index |