pith. sign in

arxiv: 1804.07267 · v1 · pith:7PLXIXRGnew · submitted 2018-04-19 · 🧮 math.CO

Pattern restricted quasi-Stirling permutations

classification 🧮 math.CO
keywords permutationsquasi-stirlinglabeledorderedpatternrootedstirlingtrees
0
0 comments X
read the original abstract

We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset $\{1,1,2,2,\ldots, n,n\}$ that avoid the patterns 1212 and 2121. Their study is motivated by a known relationship between Stirling permutations and increasing ordered rooted labeled trees. We construct a bijection between quasi-Stirling permutations and the set of ordered rooted labeled trees and investigate pattern avoidance for these permutations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.