Essential covers of the hypercube require many hyperplanes

DOI10.1017/S0963548324000257MaRDI QIDQ6880001zbMATH OpenFDO

Authors Lisa Sauermann

Publication date 29 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548324000257

zbMATH Keywords

essential covershypercube

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites work

• A lower bound for essential covers of the cube
• A Solution of the "Plank Problem"
• Combinatorial Nullstellensatz
• Covering the cube by affine hyperplanes
• Essential covers of the cube by hyperplanes
• Essential positive covers of the cube
• On almost \(k\)-covers of hypercubes
• Probability Inequalities for Sums of Bounded Random Variables
• Slicing all edges of an \(n\)-cube requires \(n^{2/3}\) hyperplanes
• The plank problem for symmetric bodies

Cited in

(2)

• Covering the hypercube, the uncertainty principle, and an interpolation formula
• Plank theorems and their applications: a survey

This page was built for publication: Essential covers of the hypercube require many hyperplanes

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