标题： 图关联多面体的伽马多项式之间的不等式 显示英文标题

标题： Inequalities between gamma-polynomials of graph-associahedra

摘要： 我们通过在具有$n$个顶点的树图集合上定义一个偏序，证明了 Postnikov、Reiner 和 Williams 的一个猜想，该偏序在它们相关图的 associahedra 的$\gamma$多项式之间产生了不等式。 该偏序通过将可以通过称为树移位的操作相互获得的树相关联来给出。 我们还表明，树移位会降低非树图的$\gamma$多项式，这与 Babson 和 Reiner 的 flossing 移动效果相同。 显示英文摘要

摘要： We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the $\gamma$-polynomials of graphs that are not trees, as do the flossing moves of Babson and Reiner.