Related papers: Caylerian polynomials
In this paper, we study gamma-positivity of descent-type polynomials by introducing the change of context-free grammars method. We first present grammatical proofs of the gamma-positivity of the Eulerian polynomials, type B Eulerian…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
We give a new proof that the empirical measures of the roots of Eulerian polynomials converge to a certain log-Cauchy distribution. To do so, we show that each moment of the roots of a related family of polynomials not only converge, but in…
Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomials. In particular, we discover that the Euler number…
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.
Colored multiset Eulerian polynomials are a common generalization of MacMahon's multiset Eulerian polynomials and the colored Eulerian polynomials, both of which are known to satisfy well-studied distributional properties including…
We investigate Mahonian and Eulerian probability distributions given by inversions and descents in general finite Coxeter groups. We provide uniform formulas for the means and variances in terms of Coxeter group data in both cases. We also…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…
The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…
A permutation $\sigma=\sigma_1 \sigma_2 \cdots \sigma_n$ has a descent at $i$ if $\sigma_i>\sigma_{i+1}$. A descent $i$ is called a peak if $i>1$ and $i-1$ is not a descent. The size of the set of all permutations of $n$ with a given…
In this paper, we study nonlinear differential equations arising from Eulerian polynomials and their applications. From our study of nonlinear differential equations, we derive some new and explicit identities involving Eulerian and…
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…
The central binomial series at negative integers are expressed as a linear combination of values of certain two polynomials. We show that one of the polynomials is a special value of the bivariate Eulerian polynomial and the other…
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 this paper, we give a type B analogue of the 1/k-Eulerian polynomials. Properties of this kind of polynomials, including combinatorial interpretations, recurrence relations and gamma-positivity are studied. In particular, we show that…
The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…
We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue 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$…
In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.