Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
From MaRDI portal
(Redirected from Publication:888595)
Abstract: We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter generalization of the well-known Eulerian numbers. We give the generating function for this new class of numbers and, in the simplest cases, we find closed formulas for them and the corresponding row polynomials. By using a non-trivial involution our generalized Eulerian numbers can be mapped onto a family of generalized Ward numbers, forming a Riordan inverse pair, for which we also provide a combinatorial interpretation.
Recommendations
- Stirling numbers of forests and cycles
- Generalized Stirling permutations, families of increasing trees and urn models
- Generalized higher order Stirling numbers
- On a generalization of Stirling numbers
- On generalized Stirling numbers
- The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
- A generalization of the Stirling numbers
- Publication:4936010
- Combinatorial interpretation of generalized Stirling numbers
- Combinatorially interpreting generalized Stirling numbers
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1253984 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 3433888 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- Analysis of statistics for generalized Stirling permutations
- Apropos Two Notes on Notation
- Bivariate generating functions for a class of linear recurrences: general structure
- Combinatorics of permutations
- Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
- Context-free grammars, differential operators and formal power series
- Enumeration of permutations by rises and cycle structure.
- Eulerian numbers and polynomials of higher order
- Eulerian numbers of higher order
- Generalized Stirling permutations, families of increasing trees and urn models
- Hilbert polynomials in combinatorics
- Inverse descents of \(r\)-multipermutations
- On the Lambert \(w\) function
- Recurrences and formulae in an extension of the Eulerian numbers
- Stirling polynomials
- The Representation of Stirling's Numbers and Stirling's Polynomials as Sums of Factorials
- The Sheffer group and the Riordan group
- The \(r\)-multipermutations
- Théorie géométrique des polynômes eulériens
- P-partitions and q-Stirling numbers
Cited in
(8)- Ordered Forests, Permutations, and Iterated Integrals
- An asymptotic distribution theory for Eulerian recurrences with applications
- Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity
- Descents on quasi-Stirling permutations
- Triangular recurrences, generalized Eulerian numbers, and related number triangles
- Generalized r-Lah numbers
- Analysis of statistics for generalized Stirling permutations
- scientific article; zbMATH DE number 7106992 (Why is no real title available?)
This page was built for publication: Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888595)
