Enumeration formulæ for pattern restricted Stirling permutations
From MaRDI portal
Publication:456658
DOI10.1016/j.disc.2012.07.011zbMath1252.05011OpenAlexW2072144681MaRDI QIDQ456658
Publication date: 16 October 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.011
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items (5)
Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ Unnamed Item ⋮ ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS ⋮ The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations ⋮ Pattern restricted quasi-Stirling permutations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Stirling permutations, families of increasing trees and urn models
- Stirling polynomials
- The \(r\)-multipermutations
- Generating functions for generating trees
- Hilbert polynomials in combinatorics
- The kernel method: a collection of examples
- Restricted permutations from Catalan to Fine and back
- Words restricted by patterns with at most 2 distinct letters
- Restricted permutations and Chebyshev polynomials
- 2-binary trees: bijections and related issues
- Avoiding patterns of length three in compositions and multiset permutations
- Plane recursive trees, Stirling permutations and an urn model
- Analysis of Statistics for Generalized Stirling Permutations
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
- Restricted permutations
- Permutations of a multiset avoiding permutations of length 3
This page was built for publication: Enumeration formulæ for pattern restricted Stirling permutations
