The minimum hyperplane-covering conjecture for finite grids
The minimum hyperplane-covering conjecture for finite grids
Let be a ring, and let be nonempty (but possibly infinite) subsets. Let be a covering of the grid
by hyperplanes. The minimum hyperplane-covering conjecture. Then
This extends the finite-grid lower bound for hyperplane coverings to possibly infinite coordinate sets; the supplied text does not indicate whether the assertion is known in this generality.
Sources & referencesView supporting material
Primary source
Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi and John R. Schmitt, “On zeros of a polynomial in a finite grid”, arXiv:1508.06020 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.