Context-free Grammars and Multivariate Stable Polynomials over Stirling Permutations

DOI10.1007/978-3-030-44559-1_7arXiv1208.1420MaRDI QIDQ6234891FDOQ6234891

Authors: William Y. C. Chen, Robert X. J. Hao, Harold R. L. Yang 

Publication date: 7 August 2012

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'{o}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.

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

This page was built for publication: Context-free Grammars and Multivariate Stable Polynomials over Stirling Permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234891)