scientific article; zbMATH DE number 7106992

zbMath1419.05009MaRDI QIDQ5197595

Markus Kuba, Alois Panholzer

Publication date: 19 September 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p216.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptotic results\(k\)-Stirling permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration formulæ for pattern restricted Stirling permutations
• Generalized Stirling permutations, families of increasing trees and urn models
• Patterns in permutations and words.
• A short proof for the number of permutations containing pattern 321 exactly once
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Counting occurrences of 132 in a permutation
• Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
• Stirling polynomials
• The \(r\)-multipermutations
• Generating functions for generating trees
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Finite automata and pattern avoidance in words
• The kernel method: a collection of examples
• Restricted permutations from Catalan to Fine and back
• Restricted permutations and Chebyshev polynomials
• The number of permutations containing exactly one increasing subsequence of length three
• The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
• Avoiding patterns of length three in compositions and multiset permutations
• Pattern avoidance in compositions and multiset permutations
• Analysis of Statistics for Generalized Stirling Permutations
• Permutations of a multiset avoiding permutations of length 3

This page was built for publication: