Slicing all edges of an n-cube requires n^2/3 hyperplanes

DOI10.1109/FOCS57990.2023.00117MaRDI QIDQ6942848zbMATH OpenFDO

Authors Ohad Klein

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00117

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Covering the hypercube, the uncertainty principle, and an interpolation formula
• Essential covers of the hypercube require many hyperplanes
• Nondegenerate hyperplane covers of the hypercube

This page was built for publication: Slicing all edges of an \(n\)-cube requires \(n^{2/3}\) hyperplanes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942848)