A Review of the packing problem (Q3742406)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3978022
Language Label Description Also known as
default for all languages
No label defined
    English
    A Review of the packing problem
    scientific article; zbMATH DE number 3978022

      Statements

      A Review of the packing problem (English)
      0 references
      0 references
      0 references
      1986
      0 references
      Palasti conjecture
      0 references
      sequential random packing
      0 references
      packing density
      0 references
      random packing density of molecules
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      This paper is a review of asymptotic methods and results for sequential random packing in one and higher dimensions. In one dimension, the problem is as follows: Segments of unit-length are packed successively at random on a fixed interval of length \(x>1\). The process terminates if there is no place for one more unit-length segment. This problem is known as ''parking problem''. For various probability models, the mean packing density is investigated as \(x\to \infty\). First results were obtained by Renyi and independently by Dvoretzky and Robbins, using analytical methods. In higher dimensions, simulation methods were used to investigate the analogous problems. These questions originated with the attempt of a physical chemist, J. D. Bernal, to classify the inert gases by the mean random packing density of molecules (spheres). Some more interesting applications and open problems are indicated in this paper.
      0 references

      Identifiers