Abstract
Stirling k-ary words resemble classical Stirling permutations except that all entries of a Stirling k-ary word of length n belong to the set {1,2,...,k}. We first study generating functions for the number of pattern restricted Stirling k-ary words with a given number of plateaux by using the kernel method. We then study the generating function for the number of Stirling k-ary words of length n according to the number of distinct letters.
| Original language | English |
|---|---|
| Pages (from-to) | 100-108 |
| Number of pages | 9 |
| Journal | Discrete Applied Mathematics |
| Volume | 206 |
| DOIs | |
| State | Published - 19 Jun 2016 |
Bibliographical note
Publisher Copyright:© 2016 Elsevier B.V.
Keywords
- Kernel method
- Plateaux
- Stirling k-ary words
- Stirling permutations
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics