Related papers: The ascent-plateau statistics on Stirling permutat…
We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…
We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…
Stirling numbers of the first kind are used in the derivation of several population genetics statistics, which in turn are useful for testing evolutionary hypotheses directly from DNA sequences. Here, we explore the cumulative distribution…
A number of identities are proved by using Stirling transforms. These identities involve Stirling numbers of the first and second kinds, hyperharmonic and derangement numbers, Bernoulli and Euler numbers and polynomials, powers, power sums,…
We study the Ehrhart theory of hypersimplices of type C, as introduced by Lam and Postnikov for general crystallographic root systems. The $h^*$-polynomials of classical hypersimplices are known to relate to various Eulerian statistics on…
One of the most popular class of tests for independence between two random variables is the general class of rank statistics which are invariant under permutations. This class contains Spearman's coefficient of rank correlation statistic,…
We provide a general framework for proving asymptotic equidistribution, convexity, and log concavity of coefficients of generating functions on arithmetic progressions. Our central tool is a variant of Wright's Circle Method proved by two…
In this paper, we consider the poly-Bernoulli numbers and polynomials of the second kind and presents new and explicit formulae for calculating the poly-Bernoulli numbers of the second kind and the Stirling numbers of the second kind.
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect…
The Goulden$\unicode{x2013}$Jackson cluster method, adapted to permutations by Elizalde and Noy, reduces the problem of counting permutations by occurrences of a prescribed consecutive pattern to that of counting clusters, which are special…
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.
Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…
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…
Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further…
Physical and mathematical applications of fractional Poisson probability distribution have been presented. As a physical application, a new family of quantum coherent states has been introduced and studied. As mathematical applications, we…
The stratified linear permutation statistic arises in various statistics problems, including stratified and post-stratified survey sampling, stratified and post-stratified experiments, conditional permutation tests, etc. Although we can…
It is well known that Gaussian polynomials (i.e., $q$-binomials) describe the distribution of the $area$ statistic on monotone paths in a rectangular grid. We introduce two new statistics, $corners$ and $cindex$; attach ``ornaments'' to the…
We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…
In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…