Related papers: Eulerian pairs and Eulerian recurrence systems
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
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…
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…
We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…
The aim of this paper is to study degenerate Eulerian polynomials and degenerate Eulerian numbers, respectively as degenerate versions of the Eulerian polynomials and the Eulerian numbers, and to derive some of their properties.…
We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…
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 combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
We study the joint distribution of descents and sign for elements of the symmetric group and the hyperoctahedral group (Coxeter groups of types $A$ and $B$). For both groups, this has an application to riffle shuffling: for large decks of…
Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…
We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…
Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations…
We introduce new recurrences for the type B and type D Eulerian polynomials, and interpret them combinatorially. These recurrences are analogous to a well-known recurrence for the type A Eulerian polynomials. We also discuss their…
Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the "descending power" Eulerian polynomials, and their once shifted sequence, are moment sequences for simple families of orthogonal polynomials,…
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…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
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,…
We show that the pair (des, ides) of statistics on the set of permu- tations has the same distribution as the pair (asc, row) of statistics on the set of inversion tables, proving a conjecture of Visontai. The common generating function of…