A combinatorial approach to height sequences in finite partially ordered sets (Q629196)

Given an element \(x\) of a finite partially ordered set \(P\), the \(i\)th entry of the height sequence associated to \(x\) records the number of linear extensions of \(P\) in which position \(i\) is occupied by \(x\). Using the Alexandrov-Fenchel inequalities for mixed volumes of convex bodies, \textit{R. P. Stanley} [J. Comb. Theory, Ser. A 31, 56--65 (1981; Zbl 0484.05012)] showed that every height sequence is log-concave. A combinatorial proof of this result is given in the paper under review in the special case in which the set of elements of \(P\) which are incomparable to \(x\) is either a chain or a two-element antichain.