Related papers: A note on Stirling permutations
This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…
We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be…
Recently, the degenerate Stirling numbers of the first kind were introduced. In this paper, we give some formulas for the degenerate Stirling numbers of the first kind in the terms of the complete Bell polynomials with higher-order harmonic…
Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants.…
Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…
We introduce the notion of almost realizability, an arithmetic generalization of realizability for integer sequences, which is the property of counting periodic points for some map. We characterize the intersection between the set of…
Let Y be a random variable satisfying specific moment conditions. This paper introduces and investigates probabilistic heterogeneous Stirling numbers of the second kind and probabilistic heterogeneous Bell polynomials. These structures…
In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Fa\`a di Bruno formula, and with the help of several identities and closed-form formulas for the partial…
Recently, the $\lambda$-analogues of $r$-Stirling numbers of the first kind were studied by Kim-Kim. The aim of this paper is to introduce the $\lambda$-analogues of $r$-Stirling numbers of the second kind and to investigate some…
This work deals with a new generalization of $r$-Stirling numbers using $l$-tuple of permutations and partitions called $(l,r)$-Stirling numbers of both kinds. We study various properties of these numbers using combinatorial interpretations…
An identity of Chung, Graham and Knuth involving binomial coefficients and Eulerian numbers motivates our study of a class of polynomials that we call binomial-Eulerian polynomials. These polynomials share several properties with the…
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…
We consider two types of polynomials $F_n (x) = \sum_{\nu=1}^n \nu! S_2(n,\nu) x^\nu$ and $\hat{F}_n (x) = \sum_{\nu=1}^n \nu! S_2(n,\nu) H_\nu x^\nu$, where $S_2(n,\nu)$ are the Stirling numbers of the second kind and $H_\nu$ are the…
A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] showed the connection between Stirling permutations and plane…