| Speaker: Dustin Mixon Affiliation: Ohio State University Time: 4:00 pm Friday, 29 November, 2019 Location: Mathematics & Physics Building |
| Given a compact metric space, it is natural to ask how to arrange a given number of points so that the minimum distance is maximized. According to legend, packing points in the unit 2-sphere with the great-circle distance incited a dispute in 1694 between Isaac Newton and David Gregory. More recently, packing binary vectors with the Hamming distance has produced codebooks that form the foundation of error correction in digital communication. In this talk, we consider the problem of packing points in projective spaces. We briefly discuss applications before surveying the state of the art and identifying key open problems |