Quasi-Stirling Permutations on Multisets
Combinatorics
2021-06-09 v1
Abstract
A permutation of a multiset is said to be a {\em quasi-Stirling } permutation if there does not exist four indices such that and . Define where denotes the set of quasi-Stirling permutations on the multiset , and (resp. , ) denotes the number of ascents (resp. descents, plateaux) of . Denote by the multiset , where is an -composition of for positive integers and . In this paper, we show that for any two -compositions and of . This is accomplished by establishing an -preserving bijection between and . As applications, we obtain generalizations of several results for quasi-Stirling permutations on obtained by Elizalde and solve an open problem posed by Elizalde.
Cite
@article{arxiv.2106.04348,
title = {Quasi-Stirling Permutations on Multisets},
author = {Sherry H. F. Yan and Lihong Yang and Yunwei Huang and Xue Zhu},
journal= {arXiv preprint arXiv:2106.04348},
year = {2021}
}