摘要
We present a simple transformation for the inversion number and major index statistics on the labelings of a rooted tree with n vertices in the form of a rake with k teeth. The special case k= 0 provides a simple transformation for the Mahonian statistics on the set Sn of permutations of { 1 , 2 , ⋯ , n}. We also extend the transformation to a bijective interpretation of the fact that the major index of the equivalence classes of the labelings is equidistributed with the major index of the permutations in Sn satisfying the condition that the elements 1 , 2 , ⋯ , k appear in increasing order.
原文 | 英語 |
---|---|
頁(從 - 到) | 373-381 |
頁數 | 9 |
期刊 | Graphs and Combinatorics |
卷 | 34 |
發行號 | 2 |
DOIs | |
出版狀態 | 已發佈 - 2018 3月 1 |
ASJC Scopus subject areas
- 理論電腦科學
- 離散數學和組合