Coefficientwise total-positivity conjecture for the four-parameter recurrence triangle

Let a,c,d,ea,c,d,e be algebraic indeterminates, and define T(n,k)T(n,k) by

T(n,k)=[a(nk)+c]T(n1,k1)+(dk+e)T(n1,k)T(n,k)=[a(n-k)+c]T(n-1,k-1)+(dk+e)T(n-1,k)

for n1n\geq 1, with T(0,k)=δk0T(0,k)=\delta_{k0}. Thus T=(T(n,k))n,k0\bm{T}=(T(n,k))_{n,k\geq 0} is a lower-triangular matrix over Z[a,c,d,e]\mathbb{Z}[a,c,d,e]. A polynomial is nonnegative in the coefficientwise order when all its coefficients are nonnegative, and a polynomial matrix is coefficientwise totally positive when all its minors have nonnegative coefficients. Four-parameter coefficientwise total-positivity conjecture. The lower-triangular matrix T\bm{T} defined by the recurrence above is coefficientwise totally positive in the indeterminates a,c,d,ea,c,d,e. This conjecture would imply the clean Eulerian and reversed Stirling conjectures under the specializations (a,c,d,e)=(1,1,1,1)(a,c,d,e)=(1,1,1,1) and (1,0,0,1)(1,0,0,1), respectively; the source gives no proof of the general assertion.

Sources & referencesView supporting material

Primary source

Xi Chen, Bishal Deb, Alexander Dyachenko, Tomack Gilmore and Alan D. Sokal, “Coefficientwise total positivity of some matrices defined by linear recurrences”, arXiv:2012.03629 (2020).

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.