ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and ℓ\ell be integers satisfying n≥ℓ≥1n\geq \ell\geq 1. Let totalD⁡(n,k)\operatorname{totalD}(n,k) denote the total quantity studied in the paper, and let totalDTrunc⁡(n,k)\operatorname{totalDTrunc}(n,k) denote its truncated version. For each ℓ\ell, let aℓ(n)a_{\ell}(n) and bℓ(n)b_{\ell}(n) be polynomials in nn. Polynomial-formula conjecture. For all n≥ℓ≥1n\geq \ell\geq 1, \

\operatorname{totalD}(n,2\ell-1)-\operatorname{totalDTrunc}(n,2\ell-1)=\frac{a_{\ell}(n)}{(n+2\ell+2)^{(2\ell-2)}}{2n \choose n-2\ell-1} \

and \

\operatorname{totalD}(n,2\ell)-\operatorname{totalDTrunc}(n,2\ell)=\frac{b_{\ell}(n)}{(n+2\ell+4)^{(2\ell-2)}}{2n+1 \choose n-2\ell-2}. \

Here aℓ(n)a_{\ell}(n) and bℓ(n)b_{\ell}(n) have degree 2ℓ−22\ell-2 and non-negative integer coefficients; the leading coefficient of aℓ(n)a_{\ell}(n) is 2ℓ−12\ell-1, and the leading coefficient of bℓ(n)b_{\ell}(n) is ℓ\ell. The conjecture would provide a simplified expression for totalDTrunc⁡(n,ℓ)\operatorname{totalDTrunc}(n,\ell), but the supplied text gives no resolution.

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.