Skip to main navigation Skip to search Skip to main content

Exact hyperplane covers for subsets of the hypercube

  • James Aaronson
  • , Carla Groenland
  • , Andrzej Grzesik
  • , Tom Johnston
  • , Bartłomiej Kielak

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Article number112490
Pages (from-to)1-7
JournalDiscrete Mathematics
Volume344
Issue number9
DOIs
Publication statusPublished - 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