加载中…
The cross–product conjecture (CPC) of Brightwell, Felsner and Trotter (1995) is a two-parameter quadratic inequality for the number of linear extensions of a poset with given value differences on three distinct elements in . We give two different proofs of this inequality for posets of width two. The first proof is algebraic and generalizes CPC to a four-parameter family. The second proof is combinatorial and extends CPC to a -analogue. Further applications include relationships between CPC and other poset inequalities, including a new -analogue of the Kahn–Saks inequality.

生成讲解博客的中文版本

生成AI智能校验的中文版本