|
|
|
|
| LEADER |
01123nam a2200145Ia 4500 |
| 001 |
10.37236-10953 |
| 008 |
220718s2022 CNT 000 0 und d |
| 020 |
|
|
|a 10778926 (ISSN)
|
| 245 |
1 |
0 |
|a On a conjecture concerning shuffle-compatible permutation statistics
|
| 260 |
|
0 |
|b Australian National University
|c 2022
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.37236/10953
|
| 520 |
3 |
|
|a The notion of shuffle-compatible permutation statistics was implicit in Stanley’s work on P-partitions and was first explicitly studied by Gessel and Zhuang. The aim of this paper is to prove that the triple (udr, pk, des) is shuffle-compatible as conjectured by Gessel and Zhuang, where udr denotes the number of up-down runs, pk denotes the peak number, and des denotes the descent number. This is accomplished by establishing an (udr, pk, des)-preserving bijection in the spirit of Baker-Jarvis and Sagan’s bijective proofs of the shuffle compatibility property of permutation statistics. © The authors.
|
| 700 |
1 |
|
|a Yan, S.H.F.
|e author
|
| 700 |
1 |
|
|a Yang, L.
|e author
|
| 773 |
|
|
|t Electronic Journal of Combinatorics
|x 10778926 (ISSN)
|g 29 3
|
