Quasi-Stirling Permutations on Multisets
Abstract
A permutation π of a multiset is said to be a quasi-Stirling permutation if there does not exist four indices i<j<k< such that πi=πk and πj=π. Define QM(t,u,v)=Σπ∈ QMtdes(π)uasc(π)vplat(π), where QM denotes the set of quasi-Stirling permutations on the multiset M, and asc(π) (resp. des(π), plat(π)) denotes the number of ascents (resp. descents, plateaux) of π. Denote by Mσ the multiset \1σ1, 2σ2, …, nσn\, where σ=(σ1, σ2, …, σn) is an n-composition of K for positive integers K and n. In this paper, we show that QMσ(t,u,v)=QMτ(t,u,v) for any two n-compositions σ and τ of K. This is accomplished by establishing an (asc, des, plat)-preserving bijection between QMσ and QMτ. As applications, we obtain generalizations of several results for quasi-Stirling permutations on M=\1k,2k, …, nk\ obtained by Elizalde and solve an open problem posed by Elizalde.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.