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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
