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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.