Related papers: Eulerian pairs and Eulerian recurrence systems
Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…
We introduce sub-Eulerian polynomials to count elements of $D_n$ by which a recurrence relation for the Eulerian polynomials of type $D$ is obtained.
We introduce partial duality of hypermaps, which include the classical Euler-Poincar\'e duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation…
In this paper, we first consider a generalization of the David-Barton identity which relate the alternating run polynomials to Eulerian polynomials. By using context-free grammars, we then present a combinatorial interpretation of a family…
In this paper, the structures to a family of biorthogonal polynomials that approximate to the Hermite and Generalized Laguerre polynomials are discussed respectively. Therefore, the asymptotic relation between several orthogonal polynomials…
This paper was motivated by a conjecture of Br\"{a}nd\'{e}n (European J. Combin. \textbf{29} (2008), no.~2, 514--531) about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the…
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
The main object of this paper is to investigate a new class of the generalized Hurwitz type poly-Bernoulli numbers and polynomials from which we derive some algorithms for evaluating the Hurwitz type poly-Bernoulli numbers and polynomials.…
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 $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…
The aim of this paper is to investigate some properties, recurrence relations and identities involving degenerate Stirling numbers of both kinds associated with degenerate hyperharmonic numbers and also with degenerate Bernolli, degenerate…
In this paper, we establish a connection between the 1/k-Eulerian polynomials introduced by Savage and Viswanathan (Electron. J. Combin. 19(2012), P9) and k-Stirling permutations. We also introduce the dual set of Stirling permutations.
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
In this paper, the asymptotic formulas for Eulerian numbers, refined Eulerian numbers and the coefficients of descent polynomials are obtained directly from the spline interpretations of these numbers. Having related these numbers directly…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
This paper introduces a colored generalization of the Eulerian polynomials, denoted the $\alpha$-colored Eulerian polynomials. We first compute these polynomials by taking the $h$-vector of the $\alpha$-colored permutohedron, a colored…
Within the group algebras of the symmetric and hyperoctahedral groups, one has their descent algebras and families of Eulerian idempotents. These idempotents are known to generate group representations with topological interpretations, as…
One of the most central result in combinatorics says that the descent statistic and the excedance statistic are equidistribued over the symmetric group. As a continuation of the work of Shareshian-Wachs (Adv. Math., 225(6) (2010),…
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…