density of binary disc packings
play

Density of Binary Disc Packings Thomas Fernique CNRS & Univ. - PowerPoint PPT Presentation

Density of Binary Disc Packings Thomas Fernique CNRS & Univ. Paris 13 Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings?


  1. Density of Binary Disc Packings Thomas Fernique CNRS & Univ. Paris 13

  2. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? 1/16

  3. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Toth, 1943) The maximum density of sphere packings in R 2 is π 3 ≈ 0 . 9069 . √ 2 1/16

  4. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Toth, 1943) The maximum density of sphere packings in R 2 is π 3 ≈ 0 . 9069 . √ 2 1/16

  5. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Toth, 1943) The maximum density of sphere packings in R 2 is π 3 ≈ 0 . 9069 . √ 2 1/16

  6. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Toth, 1943) The maximum density of sphere packings in R 2 is π 3 ≈ 0 . 9069 . √ 2 1/16

  7. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Toth, 1943) The maximum density of sphere packings in R 2 is π 3 ≈ 0 . 9069 . √ 2 1/16

  8. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Hales, 1998) The maximum density of sphere packings in R 3 is π 2 ≈ 0 . 7404 . √ 3 1/16

  9. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Hales, 1998) The maximum density of sphere packings in R 3 is π 2 ≈ 0 . 7404 . √ 3 1/16

  10. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Hales, 1998) The maximum density of sphere packings in R 3 is π 2 ≈ 0 . 7404 . √ 3 1/16

  11. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Vyazovska, 2017) The maximum density of sphere packings in R 8 is π 4 384 ≈ 0 . 2536 . It is reached for spheres centered on the E 8 lattice. 1/16

  12. Sphere packings Sphere packing: interior disjoint unit spheres. Density: limsup of the proportion of B (0 , r ) covered. Questions: maximum density? densest packings? Theorem (Vyazovska et al., 2017) The maximum density of sphere packings in R 24 is π 12 12! ≈ 0 . 0019 . It is reached for spheres centered on the Leech lattice. 1/16

  13. Unequal sphere packings The density becomes parametrized by the ratios of sphere sizes. Natural problem in materials science! 2/16

  14. Unequal sphere packings The density becomes parametrized by the ratios of sphere sizes. Natural problem in materials science! Simplest non-trivial case: two discs in R 2 , i.e. , binary disc packings. 2/16

  15. Density of binary disc packings The maximum density is a function δ ( r ) of the ratio r ∈ (0 , 1). 3/16

  16. Lower bounds The hexagonal compact packing yields a uniform lower bound. 4/16

  17. Lower bounds Any given packing yields a lower bound for a specific r . 4/16

  18. Lower bounds It can be extended over a neighborhood of r (more or less cleverly). 4/16

  19. Lower bounds It can be extended over a neighborhood of r (more or less cleverly). 4/16

  20. Upper bounds First upper bound by Florian in 1960. 5/16

  21. Upper bounds 7 5 First upper bound by Florian in 1960. Improved by Blind in 1969. 5/16

  22. Tight bounds 7 5 � 7 tan( π/ 7) − 6 tan( π/ 6) Blind’s bound is tight for r ≥ 6 tan( π/ 6) − 5 tan( π/ 5) ≈ 0 . 743 6/16

  23. Tight bounds � � π π π On the other side: lim r → 0 δ ( r ) = 3 + 1 − 3 ≃ 0 . 9913 √ √ √ 2 2 3 2 6/16

  24. Tight bounds 9 8 7 6 5 4 3 2 1 The exact maximum density is also known for 9 ”magic” ratios! 6/16

  25. Compact packings Theorem (Heppes’00, Heppes’03, Kennedy’04, B´ edaride-F.’20) These periodic binary disc packings have maximum density. 7/16

  26. Compact packings Theorem (Kennedy, 2006) The ratios are those that allow for a triangulated contact graph. 7/16

  27. Flipping and flowing The disc ratio of a compact packing is determined by the contacts. 8/16

  28. Flipping and flowing Allowing some discs to separate may give a degree of freedom. . . 8/16

  29. Flipping and flowing . . . that can be used to vary continuously the ratio. . . 8/16

  30. Flipping and flowing . . . that can be used to vary continuously the ratio. . . 8/16

  31. Flipping and flowing . . . that can be used to vary continuously the ratio. . . 8/16

  32. Flipping and flowing . . . that can be used to vary continuously the ratio. . . 8/16

  33. Flipping and flowing . . . until it is blocked by new contacts. 8/16

  34. Flipping and flowing Some cases may be tricky: how many (which) contacts to keep? 8/16

  35. Flipping and flowing Some cases may be tricky: how many (which) contacts to keep? 8/16

  36. Flipping and flowing Some cases may be tricky: how many (which) contacts to keep? 8/16

  37. Flipping and flowing Some cases may be tricky: how many (which) contacts to keep? 8/16

  38. Lower bounds reloaded 9 8 7 6 5 4 3 2 1 Flipping and flowing greatly improves the lower bound. 9/16

  39. Lower bounds reloaded 9 8 7 6 5 4 3 2 1 Flipping and flowing greatly improves the lower bound. Is it tight? 9/16

  40. Other dense packings 9 8 7 6 5 4 3 2 1 For small ratio, there are many dense packings. 10/16

  41. Other dense packings 9 8 7 6 5 4 3 2 1 But they seem to become more sparse as the ratio grows. 10/16

  42. Phase separation 9 8 7 6 5 4 3 2 1 Can we at least do better than the hexagonal compact packing? 11/16

  43. Phase separation 9 8 7 6 5 4 3 2 1 Theorem (F., to be improved) π For r ∈ [0 . 445 , 0 . 514] ∪ [0 . 566 , 0 . 627] ∪ [0 . 647 , 1) , δ ( r ) = 3 . √ 2 11/16

  44. Back to materials science T. Paik, B. Diroll, C. Kagan, Ch. Murray J. Am. Chem. Soc. 137 , 2015. Binary and ternary superlattices self-assembled from colloidal nanodisks and nanorods. 12/16

  45. Back to materials science T. Paik, B. Diroll, C. Kagan, Ch. Murray J. Am. Chem. Soc. 137 , 2015. Binary and ternary superlattices self-assembled from colloidal nanodisks and nanorods. 12/16

  46. Back to materials science T. Paik, B. Diroll, C. Kagan, Ch. Murray J. Am. Chem. Soc. 137 , 2015. Binary and ternary superlattices self-assembled from colloidal nanodisks and nanorods. 12/16

  47. Phase diagram E. Fayen, A. Jagannathan, G. Foffi, F. Smallenburg J. Chem. Phys. 152 , 2020. Infinite-pressure phase diagram of binary mixtures of (non)additive hard disks. 13/16

  48. Phase diagram E. Fayen, A. Jagannathan, G. Foffi, F. Smallenburg J. Chem. Phys. 152 , 2020. Infinite-pressure phase diagram of binary mixtures of (non)additive hard disks. ◮ Based on intensive Monte-Carlo simulations; ◮ The concept of ”phase” needs to be formalized. 13/16

  49. Equivalent disc packings There is always infinitely many packings with the same density. 14/16

  50. Equivalent disc packings There is always infinitely many packings with the same density. We consider them up to almost isomorphism of Vorono¨ ı diagrams . 14/16

  51. Equivalent disc packings There is always infinitely many packings with the same density. We consider them up to almost isomorphism of Vorono¨ ı diagrams . 14/16

  52. Equivalent disc packings There is always infinitely many packings with the same density. We consider them up to almost isomorphism of Vorono¨ ı diagrams . 14/16

  53. √ Playing with stoichiometry for r = 2 − 1 Theorem (F. 2020) The densest disc packings with a proportion x of large discs are: ◮ twinnings of two periodic packings for x ≤ 0 . 5 ; 15/16

  54. √ Playing with stoichiometry for r = 2 − 1 Theorem (F. 2020) The densest disc packings with a proportion x of large discs are: ◮ twinnings of two periodic packings for x ≤ 0 . 5 ; ◮ recodings of square-triangle tilings for x ≥ 0 . 5 . 15/16

  55. Summary & perspectives ◮ Compact packings are good at maximizing the density; 16/16

  56. Summary & perspectives ◮ Compact packings are good at maximizing the density; ◮ Flipping and flowing provides a good way to limit density loss; 16/16

  57. Summary & perspectives ◮ Compact packings are good at maximizing the density; ◮ Flipping and flowing provides a good way to limit density loss; ◮ Phase separation (hexagonal packing) is almost characterized. 16/16

Recommend


More recommend