Generalize the generic half-grid covering number to arbitrary dimension

Establish the covering number for generic d-dimensional half-grids of order n when every point except the origin must be covered at least k times by hyperplanes avoiding the origin, with the asymptotic form conjectured by the authors.

Background

The paper determines asymptotically sharp covering numbers for generic half-grids in dimensions two and three. In dimension two, the relevant objects are lines covering all points except the vertex; in dimension three, they are planes covering all points except the origin. The conclusion proposes an analogous asymptotic formula for generic half-grids in every dimension, extending these low-dimensional results.

References

Inspired by our results in dimensions 2 and 3, we conjecture the following general bound. Conjecture 1. For generic d-dimensional half-grids, the covering number is equal to (1 + 2 + ... + d+I + 2)nk - O(nd-1 + k).

Covering half-grids with lines and planes  (2501.11156 - Bishnoi et al., 19 Jan 2025) in Section 4, Conclusion, Conjecture 1