Related papers: Probabilistic degenerate derangement polynomials
We introduce the generalized degenerate Euler-Genocchi polynomials as a degenerate version of the Euler-Genocchi polynomials. In addition, we introduce their higher-order version, namely the generalized degenerate Euler-Genocchi polynomials…
Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the…
Recently, authors studied the unsigned degenerate r-Stirling number of the first kind and the degenerate r-Stirling number of the second kind, respectively of which are the degenerate versions of the unsigned r-Stirling numbers of the first…
Generalizations of Bell polynomials, Bell numbers, and Stirling numbers of the second kind have been introduced and their generating functions were evaluated.
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
In this paper, we derive some identities involving special numbers and moments of random variables by using the generating functions of the moments of certain random variables. Here the related special numbers are Stirling numbers of the…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
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…
The aim of this paper is to further study some properties and identities on the degenerate Fubini and the degenerate Bell polynomials which are degenerate versions of the Fubini and the Bell polynomials, respectively. Especially, we find…
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…
Harmonic numbers have been studied since antiquity, while hyperharmonic numbers were intoduced by Conway and Guy in 1996. The degenerate harmonic numbers and degenerate hyperharmonic numbers are their respective degenerate versions. The aim…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…
In this paper, we introduce two variable degenerate Bell polynomials as a generalization of the degenerate Bell polynomials which were studied earlier. Among other things, we show their connections with Poisson degenerate central moments…
This paper introduces and investigates degenerate versions of the A-algorithm and B-algorithm by incorporating a parameter lambda into their respective recurrence relations. We derive explicit formulas for the final sequences of these…
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…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…