Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers

zbMATH Open1323.05003arXiv1307.5624MaRDI QIDQ888595FDOQ888595

Authors: 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)

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.

Full work available at URL: https://arxiv.org/abs/1307.5624

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

generalized Stirling permutationsgeneralized Eulerian numbersgeneralized Ward numbersincreasing trees and forests

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cites Work

• On the Lambert \(w\) function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stirling polynomials
• Title not available (Why is that?)
• Combinatorics of permutations
• The Sheffer group and the Riordan group
• Title not available (Why is that?)
• Generalized Stirling permutations, families of increasing trees and urn models
• The \(r\)-multipermutations
• Théorie géométrique des polynômes eulériens
• \(P\)-partitions and \(q\)-Stirling numbers
• Inverse descents of \(r\)-multipermutations
• Hilbert polynomials in combinatorics
• Analysis of statistics for generalized Stirling permutations
• Title not available (Why is that?)
• Context-free grammars, differential operators and formal power series
• Bivariate generating functions for a class of linear recurrences: general structure
• Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
• Eulerian numbers and polynomials of higher order
• Title not available (Why is that?)
• Enumeration of permutations by rises and cycle structure.
• Recurrences and formulae in an extension of the Eulerian numbers
• Eulerian numbers of higher order
• Apropos Two Notes on Notation
• The Representation of Stirling's Numbers and Stirling's Polynomials as Sums of Factorials

Cited In (8)

• 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
• Title not available (Why is that?)
• Ordered Forests, Permutations, and Iterated Integrals

Uses Software

• OEIS

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)