Particle Packing Problems for Fun and Profit

Subscribers:
345,000
Published on ● Video Link: https://www.youtube.com/watch?v=Wpy9mvzXrLc



Duration: 1:10:52
181 views
1


Packing problems, such as how densely nonoverlapping particles fill d-dimensional Euclidean space Rd are ancient and still provide fascinating challenges for scientists and mathematicians [1,2]. Bernal has remarked that heaps (particle packings) were the first things that were ever measured in the form of basketfuls of grain for the purpose of trading or of collection of taxes. While maximally dense packings are intimately related to classical ground states of matter, disordered sphere packings have been employed to model glassy states of matter. There has been a resurgence of interest in maximally dense sphere packings in high-dimensional Euclidean spaces [3,4], which is directly related to the optimal way of sending digital signals over noisy channels. I begin by first describing order maps to classify jammed sphere packings, which enables one to view a host of packings with varying degrees of disorder as extremal structures. I discuss work that provides the putative exponential improvement on a 100-year- old lower bound on the maximal packing density due to Minkowski in Rd in the asymptotic limit d ? 8 [4]. Our study suggests that disordered (rather than ordered) sphere packings may be the densest for sufficiently large d - a counterintuitive possibility. Finally, I describe recent work to find and characterize dense packings of three-dimensional nonspherical shapes of various shapes, including the Platonic and Archimedean solids [5]. We conjecture that the densest packings of the Platonic and Archimedean solids with central symmetry are given by their corresponding densest lattice packings. This is the analogue of Kepler's sphere conjecture for these solids.




Other Videos By Microsoft Research


2016-09-072009 eScience: Comment by Sketch: A picture says a million words
2016-09-07The History of Uranium
2016-09-072009 eScience: Software Support for Hybrid Computing
2016-09-072009 eScience: Computational Methods for Large Scale DNA Data Analysis
2016-09-072009 eScience: Tools for Scalable Genome Haplotying in the Windows Azure Cloud
2016-09-07Programmers and the Web: Understanding and Supporting DevelopersΓÇÖ Use of Online Resources
2016-09-07Economics Meets UI Design: Toll Bridge Pricing and P2P Backup Markets
2016-09-07Touch , Tabletop, and Tangible Blocks
2016-09-07Connected: The Surprising Power of Our Social Networks and How They Shape our Lives
2016-09-07Control Theory and Computing: An unconsummated union
2016-09-07Particle Packing Problems for Fun and Profit
2016-09-07Position-based Cryptography [1/2]
2016-09-07Improving diagramming software usability with automatic routing and placement tools
2016-09-07Enhancing Cloud SLA with Security: A secure, Searchable, and Practical Cloud Storage System
2016-09-07Contracting with Asymmetric Externalities
2016-09-07Elections and Strategic Voting: Condorcet and Borda
2016-09-07Building Systems That Enforce Measurable Security Goals
2016-09-07Conjunctive Grammars and Synchronized Alternating Pushdown Automata
2016-09-07Borrowing Brilliance: The Six Steps to Business Innovation by Building on the Ideas of Others
2016-09-07Automated reasoning in non-classical logics with the polarized inverse method
2016-09-07Where computer vision needs help from computer science



Tags:
microsoft research