The linear-growth conjecture for integer coverings of triangular grids
Statement
Let be the minimum number of hyperplanes, counted with multiplicity, needed to cover every point of the -dimensional triangular grid at least times. Saying that the function is linear in means that its dependence on has a constant slope, up to a bounded error.
Linear-growth conjecture. For all fixed and , there exists a constant such that
The paper has a linear upper bound and a trivial linear lower bound, while the conjecture asserts that an asymptotic linear formula always exists. The stronger explicit formula proposed later would imply this conjecture.
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.