Colored Eulerian Polynomials and the Colored Permutohedron
Combinatorics
2016-05-31 v1
Abstract
This paper introduces a colored generalization of the Eulerian polynomials, denoted the -colored Eulerian polynomials. We first compute these polynomials by taking the -vector of the -colored permutohedron, a colored analog of the permutohedron which we develop. We also arrive at the -colored Eulerian polynomials combinatorially by defining a new notion of descent for colored permutations.
Cite
@article{arxiv.1605.08819,
title = {Colored Eulerian Polynomials and the Colored Permutohedron},
author = {Dustin Hedmark},
journal= {arXiv preprint arXiv:1605.08819},
year = {2016}
}