Total positivity conjecture for the Narayana triangle

Let N=[N(n,k)]n,k1N=[N(n,k)]_{n,k\ge 1} be the Narayana triangle, with entries

N(n,k)=1k(n1k1)(nk1).N(n,k)=\frac{1}{k}\binom{n-1}{k-1}\binom{n}{k-1}.

Total positivity conjecture. The Narayana triangle NN is totally positive: every minor of NN is nonnegative.

The Narayana triangle is also called the Catalan triangle in the source because its row sums are the Catalan numbers. The supplied text gives no resolution status.

Sources & referencesView supporting material

Primary source

Xi Chen, Huyile Liang and Yi Wang, “Total positivity of recursive matrices”, arXiv:1601.05645 (2016).

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.