Graham's log-concavity conjecture for order-preserving maps

Let P=(X,)P=(X,\prec) be a finite poset, let xXx\in X, and let a,tN1a,t\in\mathbb N_{\geq 1} with 1<a<t1<a<t. Write Ω(P,t;x,a)\Omega(P,t;x,a) for the number of order-preserving maps g:X[t]g:X\to[t] satisfying g(x)=ag(x)=a. Graham's conjecture. For these parameters,

Ω(P,t;x,a)2Ω(P,t;x,a+1)Ω(P,t;x,a1).\Omega(P,t;x,a)^2\geq\Omega(P,t;x,a+1)\cdot\Omega(P,t;x,a-1).

This is a pointwise log-concavity assertion for the distribution of the value at a fixed element of a poset. The source attributes it to Graham and does not give evidence of a resolution.

Sources & referencesView supporting material

Primary source

Swee Hong Chan, Igor Pak and Greta Panova, “Effective poset inequalities”, arXiv:2205.02798 (2023).

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.