On the cross-product conjecture for the number of linear extensions

arXiv (Cornell University)(2023)

引用 0|浏览2
暂无评分
摘要
We prove a weak version of the cross--product conjecture: ${F}(k+1,\ell) {F}(k,\ell+1) \geq (\frac12+\varepsilon) {F}(k,\ell) {F}(k+1,\ell+1)$, where ${F}(k,\ell)$ is the number of linear extensions for which the values at fixed elements $x,y,z$ are $k$ and $\ell$ apart, respectively, and where $\varepsilon>0$ depends on the poset. We also prove the converse inequality and disprove the {generalized cross--product conjecture}. The proofs use geometric inequalities for mixed volumes and combinatorics of words.
更多
查看译文
关键词
extensions,cross-product
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要