\(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials (Q2318485): Difference between revisions

A polynomial with symmetric coefficients, or a homogenous symmetric polynomial in two variables, can be written \(\sum_{k=0}^{\left\lfloor n/2 \right\rfloor} \gamma_k x^k (1+x)^{n-2k}\) or \(\sum_{k=0}^{\left\lfloor n/2 \right\rfloor} \gamma_k (xy)^k(x+y)^{n-2k}\); it is \(\gamma\)-positive if all \(\gamma_k\ge 0\). A polynomial in three variables is partial \(\gamma\)-positive if it can be written \(\sum s_i(x,y) z^i\) and all \(s_i\) are \(\gamma\)-positive. \textit{W. Y. C. Chen}'s grammar [Theor. Comput. Sci. 117, No. 1--2, 113--129 (1993; Zbl 0788.68082)] is a context-free grammar, which is extended to a derivation \(D\). We can change grammars by substituting variables in the derivation. Descent-type polynomials enumerate generalized permutations by descents; examples include Eulerian polynomials (classical and type \(B\)), derangement polynomials, and Narayama polynomials (classical and type \(B\)). For all of these polynomials, the authors use the change of grammars method to prove \(\gamma\)-positivity. For multivariate descent-type polynomials associated to Stirling permutations, Legendre-Stirling permutations, Jacobi-Stirling permutations, and type \(B\) derangements, the method proves partial \(\gamma\)-positivity, and gives recurrence relations for the partial \(\gamma\)-coefficients. Variants of the Foata-Strehl group action [\textit{D. Foata} and \textit{V. Strehl}, Math. Z. 137, 257--264 (1974; Zbl 0274.05007)] give combinatorial interpretations of many of the partial \(\gamma\)-coefficients.