The minimum hyperplane-covering conjecture for finite grids

Let RR be a ring, and let A1,,AnRA_1,\dots,A_n\subset R be nonempty (but possibly infinite) subsets. Let H={Hj}jJ\mathcal{H}=\{H_j\}_{j\in J} be a covering of the grid

A=i=1nAiA=\prod_{i=1}^n A_i

by hyperplanes. The minimum hyperplane-covering conjecture. Then

#Jmini=1n#Ai.\#J\geq\min_{i=1}^n\#A_i.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.