ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer n≥1n\ge 1, define the Boros--Moll coefficients by Pn(x)=2−2n∑k=0n2k(2n+12k+1)(x+1)k=∑i=0ndi(n)xiP_n(x)=2^{-2n}\sum_{k=0}^{n}2^k\binom{2n+1}{2k+1}(x+1)^k=\sum_{i=0}^{n}d_i(n)x^i. Extend the finite sequence by setting di(n)=0d_i(n)=0 for i∉{0,…,n}i\notin\{0,\ldots,n\}. Define the log-concavity operator L\mathcal{L} by L(a)i=ai2−ai−1ai+1\mathcal{L}(a)_i=a_i^2-a_{i-1}a_{i+1}. The Boros--Moll conjecture asserts that, for every n≥1n\ge 1, every integer r≥0r\ge 0, and every integer ii, Lr((dj(n))j∈Z)i≥0\mathcal{L}^{r}((d_j(n))_{j\in\mathbb{Z}})_i\ge 0; equivalently, the Boros--Moll coefficient sequence is infinitely log-concave.

Record

Added
Links

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.