# Slicing the hypercube is not easy

arXiv: https://arxiv.org/abs/2102.05536 · HTML: https://mlsanity.com/paper/2102.05536/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 25 references that are in the map.
- First posted on arXiv 10 Feb 2021.

## Built on by (most cited first, 1 of 1)

- [Improved Upper Bounds for Slicing the Hypercube](https://mlsanity.com/paper/2602.16807/) (2026)

## Abstract (arXiv)

We prove that at least Omega(n0.51) hyperplanes are needed to slice all edges of the n-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the cover number of the hypercube by skew hyperplanes.