Related papers: Multinomial random combinatorial structures and $r…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
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 development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial…
Multivariate normal mixtures provide a flexible model for high-dimensional data. They are widely used in statistical genetics, statistical finance, and other disciplines. Due to the unboundedness of the likelihood function, classical…
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…
The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…
In this paper we establish plenty of number theoretic and combinatoric identities involving generalized Bernoulli and Stirling numbers of both kinds. These formulas are deduced from Pascal type matrix representations of Bernoulli and…
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
In an earlier paper, we defined and studied q-analogues of the Stirling numbers of both types for the Coxeter group of type B. In the present work, we show how this approach can be extended to all irreducible complex reflection groups G.…
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
In this paper, we will introduce the Cauchy numbers of both kinds in type B and produce their corresponding exponential generating functions. Then we will provide some identities involving Cauchy, Lah, and Stirling numbers in type B through…
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…
A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…
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,…
For any positive integer r, the r-associated Stirling number of the second kind enumerates the number of partitions of the set{1,2,3,...,n} into k non-empty disjoint subsets such that each subset contains at least r elements. We introduce…
Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. R{\'e}my showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary…
We consider the combinatorial problem where $p$ players aim to a complete set of $N$ different types of items (species) which are uniformly distributed. Let the random variables $T_{N(i)},\,\,i=1,2,\cdots,p$ denoting the number of trials…
Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics…
We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…