A unified approach to combinatorial triangles: a generalized Eulerian polynomial

From MaRDI portal
Publication:6345778

arXiv2007.12602MaRDI QIDQ6345778FDOQ6345778


Authors: Bao-Xuan Zhu Edit this on Wikidata


Publication date: 24 July 2020

Abstract: Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array [mathcalTn,k]n,kge0 satisfying the recurrence relation: �egin{equation*} mathcal {T}_{n,k}=lambda(a_0n+a_1k+a_2)mathcal {T}_{n-1,k}+(b_0n+b_1k+b_2)mathcal {T}_{n-1,k-1}+frac{cd}{lambda}(n-k+1)mathcal {T}_{n-1,k-2} end{equation*} with mathcalT0,0=1 and mathcalTn,k=0 unless 0leklen. We derive a functional transformation for its row-generating function mathcalTn(x) from the row-generating function An(x) of another array [An,k]n,k satisfying a two-term recurrence relation. Based on this transformation, we can get properties of mathcalTn,k and mathcalTn(x) including nonnegativity, log-concavity, real rootedness, explicit formula and so on. Then we extend the famous Frobenius formula, the gamma positivity decomposition and the David-Barton formula for the classical Eulerian polynomial to those of a generalized Eulerian polynomial. We also get an identity for the generalized Eulerian polynomial with the general derivative polynomial. Finally, we apply our results to an array from the Lambert function, a triangular array from staircase tableaux and the alternating-runs triangle of type B in a unified approach.













This page was built for publication: A unified approach to combinatorial triangles: a generalized Eulerian polynomial

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