Show simple item record

dc.contributor.authorPerkins, Will
dc.date.accessioned2018-05-25T15:32:15Z
dc.date.available2018-05-25T15:32:15Z
dc.date.issued2018-05-17
dc.identifier.urihttp://hdl.handle.net/1853/59726
dc.descriptionPresented as part of the Workshop on Algorithms and Randomness on May 17, 2018 at 10:15 a.m. in the Klaus Advanced Computing Building, Room 1116.en_US
dc.descriptionWill Perkins is currently a Birmingham Fellow in the School of Mathematics at the University of Birmingham in the UK. In the Fall of 2018, he will be joining the department of Mathematics, Statistics and Computer Science at the University of Illinois at Chicago. His research is a mix of probability, statistics, computer science, and combinatorics.en_US
dc.descriptionRuntime: 32:51 minutesen_US
dc.description.abstractWe prove a lower bound on the expected size of a spherical code drawn from a "hard cap" model and the expected density of a packing drawn from the hard sphere model in high dimensions. These results allows us to improve the lower bound on the kissing number in high dimensions by a factor d and to prove new lower bounds on the entropy of sphere packings of density \Theta(d 2^{-d}) in R^d. Joint work with Matthew Jenssen and Felix Joos.en_US
dc.format.extent32:51 minutes
dc.language.isoen_USen_US
dc.relation.ispartofseriesWorkshop on Algorithms and Randomness 2018en_US
dc.subjectAlgorithmsen_US
dc.subjectCodesen_US
dc.subjectKissing numbersen_US
dc.titleSphere packings, codes, and kissing numbers via hard core modelsen_US
dc.typeLectureen_US
dc.typeVideoen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Algorithms, Randomness and Complexity Centeren_US
dc.contributor.corporatenameUniversity of Birmingham. School of Mathematicsen_US


Files in this item

This item appears in the following Collection(s)

  • ARC Talks and Events [84]
    Distinguished lectures, colloquia, seminars and speakers of interest to the ARC community

Show simple item record