The explicit asymptotic formula conjecture for triangular-grid coverings
Statement
Let be the minimum number of hyperplanes, counted with multiplicity, needed to cover every point of the -dimensional triangular grid at least times. The parameters are integers subject to the displayed decompositions and ranges, and is bounded independently of for fixed .
Explicit asymptotic formula conjecture. If is odd and
with , then
where
If is even and with , then
where
This is the proposed asymptotic formula for all pairs . It would in particular imply the preceding linear-growth conjecture and extend the formulas established in the paper.
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.