ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n,d,k)f(n,d,k) be the minimum number of hyperplanes, counted with multiplicity, needed to cover every point of the dd-dimensional triangular grid Td(n)T_d(n) at least kk times. Saying that the function is linear in nn means that its dependence on nn has a constant slope, up to a bounded error.

Linear-growth conjecture. For all fixed dd and kk, there exists a constant Cd,kC_{d,k} such that

f(n,d,k)=Cd,kn+Od,k(1).f(n,d,k)=C_{d,k}n+O_{d,k}(1).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.