Some statistics on Stirling permutations and Stirling derangements

Guan Huei Duh, Yen Chi Roger Lin, Shi Mei Ma*, Yeong Nan Yeh

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


A permutation of the multiset {1,1,2,2,…,n,n} is called a Stirling permutation of order n if every entry between the two occurrences of i is greater than i for each i∈{1,2,…,n}. In this paper, we introduce the definitions of block, even indexed entry, odd indexed entry, Stirling derangement, marked permutation and bicolored increasing binary tree. We first study the joint distribution of ascent plateaux, even indexed entries and left-to-right minima over the set of Stirling permutations of order n. We then present an involution on Stirling derangements.

Original languageEnglish
Pages (from-to)2478-2484
Number of pages7
JournalDiscrete Mathematics
Issue number9
Publication statusPublished - 2018 Sept


  • Increasing trees
  • Marked permutations
  • Stirling derangements
  • Stirling permutations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Some statistics on Stirling permutations and Stirling derangements'. Together they form a unique fingerprint.

Cite this