TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Sphere Packing Solved in Higher Dimensions (2016)

25 pointsby sinemetu11almost 7 years ago

4 comments

mturmonalmost 7 years ago
As accessible on the &quot;past&quot; link above, there was a good discussion earlier on this solution of sphere-packing in d = 8 and d = 24, featuring an epic explanatory comment: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=11394534" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=11394534</a>
Osmiumalmost 7 years ago
Note this is from 2016.
RockofStrengthalmost 7 years ago
<a href="http:&#x2F;&#x2F;oeis.org&#x2F;A257479" rel="nofollow">http:&#x2F;&#x2F;oeis.org&#x2F;A257479</a> Maximal kissing number in n dimensions: maximal number of unit spheres that can touch another unit sphere.
CyberDildonicsalmost 7 years ago
Now I wait for a github link