New lower bounds for essential covers of the cube

Igor Araujo, József Balogh, Letícia Mattos

Research output: Contribution to journalArticlepeer-review

Abstract

An essential cover of the vertices of the n-cube {0, 1}n by hyperplanes is a minimal covering where no hyperplane is redundant and every variable appears in the equation of at least one hyperplane. Linial and Radhakrishnan gave a construction of an essential cover with ⌈n2⌉+1 hyperplanes and showed that Ω(n) hyperplanes are required. Recently, Yehuda and Yehudayoff improved the lower bound by showing that any essential cover of the n-cube contains at least Ω(n0.52) hyperplanes. In this paper, building on the method of Yehuda and Yehudayoff, we prove that Ω(n5/9(logn)4/9) hyperplanes are needed.

Original languageEnglish (US)
JournalIsrael Journal of Mathematics
DOIs
StateAccepted/In press - 2024

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'New lower bounds for essential covers of the cube'. Together they form a unique fingerprint.

Cite this