Counting simsun permutations by descents

Chak On CHOW, Wai Chee SHIU

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We count in the present work simsun permutations of length n by their number of descents. Properties studied include the recurrence relation and real-rootedness of the generating function of the number of n-simsun permutations with k descents. By means of generating function arguments, we show that the descent number is equidistributed over n-simsun permutations and n-André permutations. We also compute the mean and variance of the random variable Xn taking values the descent number of random n-simsun permutations, and deduce that the distribution of descents over random simsun permutations of length n satisfies a central and a local limit theorem as n → + ∞. Copyright © 2011 Springer Basel AG.
Original languageEnglish
Pages (from-to)625-635
JournalAnnals of Combinatorics
Volume15
Issue number4
DOIs
Publication statusPublished - Oct 2011

Fingerprint

Descent
Counting
Permutation
Generating Function
Local Limit Theorem
Random Permutation
Recurrence relation
Deduce
Count
Random variable

Citation

Chow, C.-O., & Shiu, W. C. (2011). Counting simsun permutations by descents. Annals of Combinatorics, 15(4), 625-635.

Keywords

  • Simsun permutations
  • Descents
  • Andr´e trees
  • Asymptotically normal