Abstract
The well-known Worpitzky identity provides a connection between two bases of : The standard basis and the binomial basis , where the Eulerian numbers for the Coxeter group of type (the symmetric group) serve as the entries of the transformation matrix. Brenti has generalized this identity to the Coxeter groups of types and (signed and even-signed permutations groups, respectively) using generating function techniques. Motivated by Foata-Schützenberger and Rawlings' proof for the Worpitzky identity in the symmetric group, we provide combinatorial proofs of this identity and for their analogues in the Coxeter groups of types and .
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.