Inequalities between gamma-polynomials of graph-associahedra

Details Inequalities between gamma-polynomials of graph-associahedra Inequalities between gamma-polynomials of graph-associahedra

2012-01-31

arxiv.org/abs/1202.0038v1

Mathematics

Combinatorics

17 pages, 11 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inequalities between gamma-polynomials of graph-associahedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inequalities between gamma-polynomials of graph-associahedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inequalities between gamma-polynomials of graph-associahedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515104