Inequalities between gamma-polynomials of graph-associahedra
The electronic journal of combinatorics, Tome 19 (2012) no. 2
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.
DOI :
10.37236/2401
Classification :
05C30, 05C05
Mots-clés : tree shifts
Mots-clés : tree shifts
Affiliations des auteurs :
Natalie Aisbett  1
@article{10_37236_2401,
author = {Natalie Aisbett},
title = {Inequalities between gamma-polynomials of graph-associahedra},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {2},
doi = {10.37236/2401},
zbl = {1243.05112},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2401/}
}
Natalie Aisbett. Inequalities between gamma-polynomials of graph-associahedra. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2401
Cité par Sources :