Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method
From MaRDI portal
Publication:277629
DOI10.1016/j.dam.2016.02.014zbMath1335.05006OpenAlexW2296044230MaRDI QIDQ277629
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.014
Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)
Related Items (3)
Shedding light on words ⋮ Geometrically distributed Stirling words and Stirling compositions ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Enumeration formulæ for pattern restricted Stirling permutations
- Some results on the avoidance of vincular patterns by multisets
- Generalized Stirling permutations, families of increasing trees and urn models
- Restricted \(k\)-ary words and functional equations
- Stirling polynomials
- Generating functions for generating trees
- Words restricted by patterns with at most 2 distinct letters
- The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
- Counting subwords in flattened partitions of sets
- Avoiding patterns of length three in compositions and multiset permutations
- Pattern avoidance in compositions and multiset permutations
- Kernel method and system of functional equations
- On restricted permutations on regular multisets
- Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
- Combinatorics of Compositions and Words
- Permutations of a multiset avoiding permutations of length 3
This page was built for publication: Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method