Log-concavity and combinatorial properties of Fibonacci lattices (Q1180792)

If \(P\) is a finite poset with bottom \(\hat 0\) and top \(\hat 1\), then for \(i\in N\), \(c_ i(P)\) denotes the number of chains of length \(i\) from \(\hat 0\) to \(\hat 1\) in \(P\) \((c_ 0(P)=0\), \(c_ 1(P)=1\), etc.). The chain polynomial of \(P\) is \(C(P,t)=\sum c_ i(P)t^ i\). Along with other related polynomials associated with finite posets \(P\), it is an interesting and difficult problem to address the question of whether the \(C(P,t)\)'s have only real roots, as conjectured for \(P=D\) a finite distributive lattice for example, where it is known as the Distributive Lattice Conjecture. In this interesting and useful paper the class of posets under consideration includes the \(r\)-Fibonacci lattices and the Fibonacci \(r\)-differential lattices and their principal order-ideals. In addition, if \(Z(P,t)=\sum c_ i(P){t \choose i}\) and if \(\sum Z(P;n)t^ n=W(P_ 1t)/(1-t)^{\ell +1}\), where \(\ell\) is the longest chain of \(P\), then the real-root question is also considered for these polynomials in the class indicated and answered in the affirmative as well. Making the appropriate connections the author is also able to show that the Fibonacci posets are included among those posets for which the Poset Conjecture (or Neggers-Stanley Conjecture) holds. The author's arguments are based on the notion of Polya frequency sequences and a theorem about real roots of polynomials whose coefficients form a \(PF\)-sequence. He is also able to provide various detailed and ingenious interpretations of the coefficients of the polynomials he deals with the classes of posets under consideration, adding further insight and detail to this expanding area of investigation.