Hacker News new | ask | show | jobs
by HighFreqAsuka 977 days ago
In computational geometry, Raimund Seidel wrote a paper that proves an upper bound theorem for polytopes in two sentences in the abstract. The rest of the paper just comments on the result.

https://www.sciencedirect.com/science/article/pii/0925772195...