Papers
Topics
Authors
Recent
2000 character limit reached

Nondegenerate hyperplane covers of the hypercube (2507.00773v1)

Published 1 Jul 2025 in math.CO

Abstract: We consider collections of hyperplanes in $\mathbb{R}n$ covering all vertices of the $n$-dimensional hypercube ${0,1}n$, which satisfy the following nondegeneracy condition: For every $v\in {0,1}n$ and every $i=1,\dots,n$, we demand that there is a hyperplane $H$ in the collection with $v\in H$ such that the variable $x_i$ appears with a non-zero coefficient in the hyperplane equation describing $H$. We prove that every collection $\mathcal{H}$ of hyperplanes in $\mathbb{R}n$ covering ${0,1}n$ with this nondegeneracy condition must have size $|\mathcal{H}|\ge n/2$. This bound is tight up to constant factors. It generalizes a recent result concerning the intensively studied skew covers problem, which asks about the minimum possible size of a hyperplane cover of ${0,1}n$ in which all variables appear with non-zero coefficients in all hyperplane equations. As an application of our result, we also obtain an essentially tight bound for an old problem about collections of hyperplanes slicing all edges of the $n$-dimensional hypercube, in the case where all of the hyperplanes have bounded integer coefficients.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.