Abstract
Alon and Füredi (1993) showed that the number of hyperplanes required to cover {0,1}n∖{0} without covering 0 is n. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the hypercube. In particular, we provide exact solutions for covering {0,1}n while missing up to four points and give asymptotic bounds in the general case. Several interesting questions are left open.
| Original language | English |
|---|---|
| Article number | 112490 |
| Pages (from-to) | 1-7 |
| Journal | Discrete Mathematics |
| Volume | 344 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - Sept 2021 |
Bibliographical note
Funding Information:This work has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 648509 ).
Publisher Copyright:
© 2021 The Author(s)
Keywords
- Exact covers
- Hypercube
- Hyperplanes
- Intersection patterns
Fingerprint
Dive into the research topics of 'Exact hyperplane covers for subsets of the hypercube'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver