Worst Packing Shapes Yoav Kallus Princeton Center for Theoretical - PowerPoint PPT Presentation

Worst Packing Shapes Yoav Kallus Princeton Center for Theoretical Sciences Princeton University Physics of Glassy and Granular Materials, YITP July 17, 2013 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 1 / 16

From Hilbert’s 18 th Problem “How can one arrange most densely in space an infinite number of equal solids of a given form, e.g., spheres with given radii or regular tetrahedra with given edges, that is, how can one so fit them together that the ratio of the filled to the unfilled space may be as large as possible?” Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 2 / 16

Packing non-spherical shapes Damasceno, Engel, and Glotzer, 2012. Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 3 / 16

The Miser’s Problem A miser is required by a contract to deliver a chest filled with gold bars, arranged as densely as possible. The bars must be identical, convex, and much smaller than the chest. What shape of gold bars should the miser cast so as to part with as little gold as possible? Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 4 / 16

Ulam’s Conjecture “Stanislaw Ulam told me in 1972 that he suspected the sphere was the worst case of dense packing of identical convex solids, but that this would be difficult to prove.” 1995 postscript to the column “Packing Spheres” Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 5 / 16

Ulam’s Last Conjecture “Stanislaw Ulam told me in 1972 that he suspected the sphere was the worst case of dense packing of identical convex solids, but that this would be difficult to prove.” 1995 postscript to the column “Packing Spheres” Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 5 / 16

Ulam’s Last Conjecture “Stanislaw Ulam told me in 1972 that he suspected the sphere was the worst case of dense packing of identical convex solids, but that this would be difficult to prove.” Naive motivation: sphere is the least free solid (three degrees of freedom vs. six for most solids). 1995 postscript to the column “Packing Spheres” Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 5 / 16

In 2D disks are not worst 0.9069 0.9024 0.8926(?) Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 6 / 16

Why can we improve over circles? Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 7 / 16

Why can we improve over circles? � 6 i =0 f ( πi 3 + ϕ ) ϕ f ( θ ) ϕ Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 8 / 16

Why can we improve over circles? � 6 i =0 f ( πi 3 + ϕ ) ϕ f ( θ ) ϕ f ( θ ) = 1 + ǫ cos (8 θ ) Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 8 / 16

Why can we not improve over spheres? Lemma Let f be an even function S 2 → R . � 12 i =1 f ( R x i ) is independent of R if and only if the expansion of f ( x ) in spherical harmonics terminates at l = 2 . YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 9 / 16

Why can we not improve over spheres? Lemma Let f be an even function S 2 → R . � 12 i =1 f ( R x i ) is independent of R if and only if the expansion of f ( x ) in spherical harmonics terminates at l = 2 . Theorem (YK) The sphere is a local minimum of the optimal packing fraction among convex, centrally symmetric bodies. YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 9 / 16

In 2D disks are not worst 0.9069 0.9024 0.8926(?) Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 10 / 16

Reinhardt’s conjecture Conjecture (K. Reinhardt, 1934) The smoothed octagon is an absolute minimum of the optimal packing fraction among convex, centrally symmetric bodies. Theorem (F. Nazarov, 1986) 0.9024 The smoothed octagon is a local minimum. K. Reinhardt, Abh. Math. Sem., Hamburg, Hansischer Universit¨ at, Hamburg 10 (1934), 216 F. Nazarov, J. Soviet Math. 43 (1988), 2687 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 11 / 16

Regular heptagon is locally worst packing Theorem (YK) Any convex body sufficiently close to the regular heptagon can be packed at a filling fraction at least that of the “double lattice” packing of regular heptagons. Note: it is not proven, but highly 0.8926(?) likely, that the “double lattice” packing is the densest packing of regular heptagons. YK, arXiv:1305.0289 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 12 / 16

Regular heptagon is locally worst packing Theorem (YK) Any convex body sufficiently close to the regular heptagon can be packed at a filling fraction at least that of the “double lattice” packing of regular heptagons. Conjecture 0.8926(?) The regular heptagon is an absolute minimum of the optimal packing fraction among convex bodies. YK, arXiv:1305.0289 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 12 / 16

Higher dimensions In 2D, the circle is not a local minimum of packing fraction among c. s. convex bodies. In 3D, the sphere is a local minimum of packing fraction among c. s. convex bodies. What can we say about spheres in higher dimensions? Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 13 / 16

Higher dimensions In 2D, the circle is not a local minimum of packing fraction among c. s. convex bodies. In 3D, the sphere is a local minimum of packing fraction among c. s. convex bodies. What can we say about spheres in higher dimensions? Note that in d > 3 we do not know the densest packing of spheres. But we do know the densest lattice packing in d = 4 , 5 , 6 , 7 , 8 , and 24. Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 13 / 16

Extreme Lattices A lattice Λ is extreme if and only if || T x || ≥ || x || for all x ∈ S (Λ) = ⇒ det T > 1 for T ≈ 1. Contact points S (Λ) of the optimal lattice. YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 14 / 16

Extreme Lattices A lattice Λ is extreme if and only if || T x || ≥ || x || for all x ∈ S (Λ) = ⇒ det T > 1 for T ≈ 1. In d = 6 , 7 , 8 , 24, the optimal lattice is redundantly extreme , and so the ball is reducible . YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 14 / 16

d = 4 and d = 5 In d = 4 , 5, if || T x || ≥ || x || for all x ∈ S (Λ) \ { x 0 } , and || T x 0 || > (1 − ǫ ) || x 0 || , then 1 − det T < C ǫ 2 (compared with C ǫ for d = 2 , 3). YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 15 / 16

d = 4 and d = 5 In d = 4 , 5, if || T x || ≥ || x || for all x ∈ S (Λ) \ { x 0 } , and || T x 0 || > (1 − ǫ ) || x 0 || , then 1 − det T < C ǫ 2 (compared with C ǫ for d = 2 , 3). ( ρ ( K ) − ρ ( B )) /ρ ( B ) ∼ ǫ 2 ( V ( B ) − V ( K )) / V ( B ) ∼ ǫ ǫ − 1 The ball is not a local minimum of the optimal packing fraction. YK, arXiv:1212.2551 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 15 / 16

Summary of new results In d = 2, the heptagon is a local minimum of the optimal packing fraction, assuming the “double lattice” packing of heptagons is their densest packing. The disk is not a local minimum. In d = 3, the ball is a local minimum among centrally symmetric bodies. In higher dimensions, at least with respect to Bravais lattice packing of centrally symmetric bodies, the ball is not a local minimum. Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 16 / 16

Worst Packing Shapes Yoav Kallus Princeton Center for Theoretical - PowerPoint PPT Presentation

Worst Packing Shapes Yoav Kallus Princeton Center for Theoretical Sciences Princeton University Physics of Glassy and Granular Materials, YITP July 17, 2013 Y. Kallus (Princeton) Worst Packing Shapes YITP 07/17/2013 1 / 16 From Hilberts

- - packing p a - packing algo- packing cking rithms algo- a l g o - theorems rithms

Shapes, Inc. We have been hired to model the business objects of Shapes, Inc. Following are their

3/13/2012 Shapes, Inc. Modeling the Shapes, Inc. Business We have been hired to model the

Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell Rutgers

AR Idea Ardavan Mirhosseini Kirsti Langen Shapes Shapes to Scan Shapes for Game Gecko Shark

Atlas Refinement with Bounded Packing Efficiency Presented by Jerry Yin Packing efficiency

Where do we use maths in the classroom? Time What time is shown on the clock? 2D Shapes What

Event Shapes in t t and QCD Events @ LHC Using transverse, 3D Event Shapes in Multivariate

Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018

Algorithms Theory 13 Bin Packing Prof. Dr. S. Albers Winter term 07/08 Bin packing 1.

The 10 Worst Presentation Habits Speakers can be their own worst enemies. Here are our expert's

Prevalence and Impact of Low-Entropy Packing Schemes in the Malware Ecosystem Alessandro

Prevalence and Impact of Low-Entropy Packing Schemes in the Malware Ecosystem Alessandro

Information Geometry in Mathematical Finance: Model Risk, Worst and Almost Worst Scenarios Imre

The Kepler Conjecture Adrian Rauchhaus 21. Juni 2018 The Theorem There is no packing of equally

Extremal Hypergraphs for Packing and Covering Penny Haxell University of Waterloo Joint work

How to Automated testing for: terraform test docker packer infrastructure

COMPONENTS TO INCLUDE Introduction - inform your audience of type of project you selected and

M any readers browsing this article One common instinct to overcome is presentation. Avoid

239 Review in Broome County GML 239-l, -m, -n, and nn Presented by: Lora Zier, Senior

ASTM meeting Belfast 23-24 September 2014 Notified body perspective: Sterile packaging

Cattle Traceability Chain Verification you can trust. IMI Global: Beef Background Selected as

BUDGET WORKSHOP FISCAL YEAR 2020 July 22 nd AGENDA FY2019 Current Fiscal Year Budget

Medical Device Plastics Custom Colored Polymers Colored polymers play a vital role in the