The three-dimensional covering conjecture
Statement
Let be the minimum number of hyperplanes, counted with multiplicity, needed to cover every point of the three-dimensional triangular grid at least times. The notation denotes a quantity bounded independently of for fixed .
Three-dimensional covering conjecture. For all ,
The formula is supported by the proved cases , the additional asymptotic result for , and computational evidence. It predicts linear growth in with the displayed parity-dependent slope.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.