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. The parameters q,rq,r are integers subject to the displayed decompositions and ranges, and Od,k(1)O_{d,k}(1) is bounded independently of nn for fixed d,kd,k.

Explicit asymptotic formula conjecture. If dd is odd and

k=d+12q+r,k=\frac{d+1}{2}q+r,

with 1≤r≤(d+1)/21\leq r\leq (d+1)/2, then

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

where

Cd,k=(q+1)(1+r−1(d+1)(q+2)/2−(r−1)).C_{d,k}=(q+1)\left(1+\frac{r-1}{(d+1)(q+2)/2-(r-1)}\right).

If dd is even and k=(d+1)q+rk=(d+1)q+r with 1≤r≤d+11\leq r\leq d+1, then

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

where

Cd,k={(2q+1)(1+r−1(d+1)(q+1)−(r−1))if 1≤r≤d/2+1,(2q+3)(1−d+2−r(d+1)(q+1)+(d+2−r))otherwise.C_{d,k}=\begin{cases} (2q+1)\left(1+\frac{r-1}{(d+1)(q+1)-(r-1)}\right)&\text{if }1\leq r\leq d/2+1,\\ (2q+3)\left(1-\frac{d+2-r}{(d+1)(q+1)+(d+2-r)}\right)&\text{otherwise.} \end{cases}

This is the proposed asymptotic formula for all pairs (d,k)(d,k). 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 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.