Related papers: Eulerian polynomials as moments, via exponential R…
Using the theory of exponential Riordan arrays, we show that the $1/k$-Eulerian polynomials are moments for a paramaterized family of orthogonal polynomials. In addition, we show that the related Savage-Viswanathan polynomials are also…
Using the theory of exponential Riordan arrays, we show that the Eulerian-Dowling polynomials are moments for a paramaterized family of orthogonal polynomials. In addition, we show that the related Dowling and the Tanny-Dowling polynomials…
In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…
We show how some special production matrices may be used to define families of generalized Eulerian triangles. We furthermore show that these generalized Eulerian triangles are the coefficient arrays of polynomials which are the moments of…
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…
Taking the examples of Legendre and Hermite orthogonal polynomials, we show how to interpret the fact that these orthogonal polynomials are moments of other orthogonal polynomials in terms of their associated Riordan arrays. We use these…
Generalization of the Euler polynomials ${{A}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{m}^{n}}{{x}^{m}}}$ are the polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…
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 introduce sub-Eulerian polynomials to count elements of $D_n$ by which a recurrence relation for the Eulerian polynomials of type $D$ is obtained.
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…
Knowing a sequence of moments of a given, infinitely supported, distribution we obtain quickly: coefficients of the power series expansion of monic polynomials $\left\{ p_{n}\right\} _{n\geq 0}$ that are orthogonal with respect to this…
In this paper we prove the strong $q$-log-convexity of the Eulerian polynomials of Coxeter groups using their exponential generating functions. Our proof is based on the theory of exponential Riordan arraya and a criterion for determining…
The Eulerian polynomials and derangement polynomials are two well-studied generating functions that frequently arise in combinatorics, algebra, and geometry. When one makes an appearance, the other often does so as well, and their…
In this paper, we characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems, which generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including flag descent…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
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…
Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev-Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they…
We show how to represent various families of Laguerre polynomials by the three-dimensional Riordan arrays, and use the fundamental theorem of Riordan arrays to obtain the corresponding exponential generating functions.