ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Δk(n)\Delta_k(n) denote the broken kk-diamond partition function, and let Lm(an)L_m(a_n) denote the discrete Laguerre expression of order mm:

Lm(an)=12∑r=02m(−1)r+m(2mr)an+ran+2m−r.L_m(a_n)=\frac{1}{2}\sum_{r=0}^{2m}(-1)^{r+m}{2m\choose r}a_{n+r}a_{n+2m-r}.

Laguerre threshold conjecture. For k=1k=1 or 22 and 1≤m≤141\leq m\leq14, the sequence Δk(n)\Delta_k(n) satisfies the Laguerre inequality of order mm, namely Lm(Δk(n))≥0L_m(\Delta_k(n))\geq0, for n≥NΔk(m)n\geq N_{\Delta_k}(m), where

m1234567891011121314NΔ1(m)11253132251420639912124516362091261232013858NΔ2(m)11045106211354539774105913981781224027493318\begin{array}{c|rrrrrrrrrrrrrr} m&1&2&3&4&5&6&7&8&9&10&11&12&13&14\\ N_{\Delta_1}(m)&1&12&53&132&251&420&639&912&1245&1636&2091&2612&3201&3858\\ N_{\Delta_2}(m)&1&10&45&106&211&354&539&774&1059&1398&1781&2240&2749&3318 \end{array}

These are computationally proposed thresholds for extending the proved low-order Laguerre inequalities.

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.