A hypercube hyperplane cover is a multiset of hyperplanes covering specified vertices of a hypercube.
An almost -cover
of
avoids the origin and covers every other vertex
at least
times. Let
be the minimum number of hyperplanes in such a cover,
counting multiplicity, where
and
are positive integers.
Alon and Füredi (1993) proved that .
More generally, Clifton and Huang (2020) proved
|
(1)
|
where
is a harmonic number and
is the ceiling function.
This bound is asymptotically tight as
for fixed
.
The relevant weighting assigns weight
to a vertex with
coordinates equal to 1, where
is a binomial coefficient. The weight
of a hyperplane
avoiding the origin is the sum
of the weights of the vertices it contains. Clifton
and Huang (2020) proved
.
Das et al. (2026) characterized equality. For the normalization
|
(2)
|
the weight equals 1 iff every is an integer at most 1 and
. There are exactly
such hyperplanes. All other hyperplanes
avoiding the origin have weight at most
. More generally, if
for a positive
integer
, then at most
of the coefficients exceed
1 and at most
are not integers.
Das et al. (2026) also proved that
|
(3)
|
for
provided
and
. For every sufficiently large
, there are infinitely many
for which
.