Context-free Grammars and Multivariate Stable Polynomials over Stirling Permutations

Abstract

Recently, Haglund and Visontai established the stability of the multivariate Eulerian polynomials as the generating polynomials of the Stirling permutations, which serves as a unification of some results of Bóna, Brenti, Janson, Kuba, and Panholzer concerning Stirling permutations. Let $B_n(x)$ be the generating polynomials of the descent statistic over Legendre-Stirling permutations, and let $T_n(x)=2^n{C}_n(x/2)$, where $C_n(x)$ are the second-order Eulerian polynomials. Haglund and Visontai proposed the problems of finding multivariate stable refinements of the polynomials $B_n(x)$ and $T_n(x)$. We obtain context-free grammars leading to multivariate stable refinements of the polynomials $B_n(x)$ and $T_n(x)$. Moreover, the grammars enable us to obtain combinatorial interpretations of the multivariate polynomials in terms of Legendre-Stirling permutations and marked Stirling permutations. Such stable multivariate polynomials provide solutions to two problems posed by Haglund and Visontai.

22 pages

References in corpus (1)

• Stable multivariate $W$-Eulerian polynomials

Cited by in corpus (9)

• Generalized Stirling permutations and forests: Higher-order Eulerian and Ward numbers
• Multivariate Eulerian polynomials and exclusion processes
• Eulerian polynomials, perfect matchings and Stirling permutations of the second kind
• Normal ordering problem and the extensions of the Stirling grammar
• Gamma-positivity and partial gamma-positivity of descent-type polynomials
• Some combinatorial sequences associated with context-free grammars
• Simsun permutations, simsun successions and simsun patterns
• Bessel polynomials, double factorials and context-free grammars
• Multivariate Stable Eulerian Polynomials on Segmented Permutations