McNamara–Sagan's infinite log-concavity conjecture for Pascal-triangle diagonals

Let L\mathcal{L} act on a sequence A={a0,a1,a2,}A=\{a_0,a_1,a_2,\ldots\} by

L(A)={a02,a12a0a2,a22a1a3,}.\mathcal{L}(A)=\{a_0^2,a_1^2-a_0a_2,a_2^2-a_1a_3,\ldots\}.

A sequence is infinitely log-concave if every iterate Lj(A)\mathcal{L}^j(A) is nonnegative. Let uu and vv be distinct nonnegative integers, and for each n0n\geq 0 consider the sequence {(n+mumv)}m0\{\binom{n+mu}{mv}\}_{m\geq 0}.

McNamara–Sagan's conjecture. The sequence {(n+mumv)}m0\{\binom{n+mu}{mv}\}_{m\geq 0} is infinitely log-concave for all n0n\geq 0 if and only if u<vu<v or v=0v=0.

This conjecture concerns diagonals of Pascal's triangle. The paper states that it was established by results of Brändén and Yu.

Sources & referencesView supporting material

Primary source

Petter Brändén and Matthew Chasse, “Infinite log-concavity for polynomial Pólya frequency sequences”, arXiv:1405.6378 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.