ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

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

for n≥1n\geq 1, with T(0,k)=δk0T(0,k)=\delta_{k0}. Thus T=(T(n,k))n,k≥0\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.

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.