相关论文: A $q$-analog of the Stirling-Eulerian Polynomials

Carlitz and Scoville introduced the polynomials $A_n(x,y|{\alpha},{\beta})$, which we refer to as the $(\alpha, \beta)$-Eulerian polynomials. These polynomials count permutations based on Eulerian-Stirling statistics, including descents,…

The Stirling permutations introduced by Gessel-Stanley have recently received considerable attention. Motivated by Ji's work on $(\alpha,\beta)$-Eulerian polynomials (Sci China Math., 2025) and Yan-Yang-Lin's work on $1/k$-Eulerian…

We introduce the binomial-Stirling-Eulerian polynomials, denoted $\tilde{A}_n(x,y|{\alpha})$, which encompass binomial coefficients, Eulerian numbers and two Stirling statistics: the left-to-right minima and the right-to-left minima. When…

In 1977 Carlitz and Scoville introduced the cycle $(\alpha,t)$-Eulerian polynomials $A^{\mathrm{cyc}}_n(x,y, t\,|\,\alpha)$ by enumerating permutations with respect to the number of excedances, drops, fixed points and cycles. In this paper,…

Noticing that some recent variations of descent polynomials are special cases of Carlitz and Scoville's four-variable polynomials, which enumerate permutations by the parity of descent and ascent positions, we prove a $q$-analogue of…

We study two generalizations of the gamma-expansion of Eulerian polynomials from the viewpoint of the decompositions of statistics. We first present an expansion formula of the trivariate Eulerian polynomials, which are the enumerators for…

Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in $\mathfrak{S}_n$ with respect to the parity of its descents and ascents. In recent work, Pan and Zeng proved a $q$-analogue of…

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

We present (bi-)symmetric generating functions for the joint distributions of Euler-Stirling statistics on permutations, including the number of descents ($\mathsf{des}$), inverse descents ($\mathsf{ides}$), the number of left-to-right…

The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…

We prove several identities expressing polynomials counting permutations by various descent statistics in terms of Eulerian polynomials, extending results of Stembridge, Petersen, and Br\"and\'en. Additionally, we find $q$-exponential…

The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

Stirling permutations were introduced by Gessel and Stanley, who used their enumeration by the number of descents to give a combinatorial interpretation of certain polynomials related to Stirling numbers. Quasi-Stirling permutations, which…

Let $\mathcal I_n$ and $\mathcal J_n$ denote the set of involutions and fixed-point free involutions of $\{1, \dots, n\}$, respectively, and let $\text{des}(\pi)$ denote the number of descents of the permutation $\pi$. We prove a conjecture…

Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…