加载中…
The well-known Worpitzky identity provides a connection between two bases of : The standard basis and the binomial basis ${{x+n-i} \choose {n}}A$ (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"utzenberger 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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本