How many hyperplanes does it take to slice all the edges of an \(n\)-dimensional hypercube? Two if you can skim the ends of the edges but more to really slice them. The obvious answer of \(n\) axis-parallel cuts can be improved to \(5n/6\), and Lance Fortnow reports in blog.computationalcomplexity.o that the newest lower bound is \(\Omega(n^{0.57})\), by Gal Yehuda and Amir Yehudayoff, improving their own new preprint

· · Web · 0 · 0 · 2
Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!