Kissing Number Problem Challenges
Jump to 5:49The kissing number problem, which determines the maximum number of non-overlapping spheres that can touch a central sphere, becomes increasingly complex in higher dimensions.
While the two-dimensional kissing number is a fixed six spheres, determining this number in higher dimensions has remained an open mathematical problem for centuries, essential for advancements in error-correction codes in information transfer.
"it turns out that in higher dimensions, it actually becomes really hard to compute what's the maximum number of over non-overlapping spheres."
"it turns out that in higher dimensions, it actually becomes really hard to compute what's the maximum number of over non-overlapping spheres."


