Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
From MaRDI portal
Publication:888595
zbMath1323.05003arXiv1307.5624MaRDI QIDQ888595
J. Fernando Barbero G., Jesús Salas, Eduardo J. S. Villaseñor
Publication date: 2 November 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5624
generalized Stirling permutationsgeneralized Eulerian numbersgeneralized Ward numbersincreasing trees and forests
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)
Related Items
Unnamed Item, Generalized \(r\)-Lah numbers, Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity, Triangular recurrences, generalized Eulerian numbers, and related number triangles, Descents on quasi-Stirling permutations, An asymptotic distribution theory for Eulerian recurrences with applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Stirling permutations, families of increasing trees and urn models
- Context-free grammars, differential operators and formal power series
- Eulerian numbers and polynomials of higher order
- Recurrences and formulae in an extension of the Eulerian numbers
- Stirling polynomials
- The \(r\)-multipermutations
- \(P\)-partitions and \(q\)-Stirling numbers
- Inverse descents of \(r\)-multipermutations
- Hilbert polynomials in combinatorics
- On the Lambert \(w\) function
- The Sheffer group and the Riordan group
- Bivariate generating functions for a class of linear recurrences: general structure
- Eulerian numbers of higher order
- Théorie géométrique des polynômes eulériens
- Combinatorics of Permutations
- Analysis of Statistics for Generalized Stirling Permutations
- Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
- Apropos Two Notes on Notation
- The Representation of Stirling's Numbers and Stirling's Polynomials as Sums of Factorials
- Enumeration of permutations by rises and cycle structure.