LEADER 02957nam  2200589 a 450 
001 9910789411603321
005 20230725031436.0
010   $a1-283-14842-0
010   $a9786613148421
010   $a981-4307-84-X
035   $a(CKB)2670000000095528
035   $a(EBL)737608
035   $a(OCoLC)733047773
035   $a(SSID)ssj0000525195
035   $a(PQKBManifestationID)12251769
035   $a(PQKBTitleCode)TC0000525195
035   $a(PQKBWorkID)10487928
035   $a(PQKB)11632844
035   $a(MiAaPQ)EBC737608
035   $a(WSP)00001258    
035   $a(Au-PeEL)EBL737608
035   $a(CaPaEBR)ebr10480246
035   $a(CaONFJC)MIL314842
035   $a(EXLCZ)992670000000095528
100   $a20100716d2011      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aRandom sequential packing of cubes$b[electronic resource] /$fMathieu Dutour Sikiric?, Yoshiaki Itoh
210   $aSingapore ;$aHackensack, N.J. $cWorld Scientific$dc2011
215   $a1 online resource (255 p.)
300   $aDescription based upon print version of record.
311   $a981-4307-83-1 
320   $aIncludes bibliographical references and index.
327   $aPreface; 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
330   $aIn 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 t
606   $aCombinatorial packing and covering
606   $aSphere packings
615  0$aCombinatorial packing and covering.
615  0$aSphere packings.
676   $a511/.6
700   $aDutour Sikiric?$b Mathieu$0739420
701   $aItoh$b Yoshiaki$f1943-$01575185
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910789411603321
996   $aRandom sequential packing of cubes$93851955
997   $aUNINA