The \(r\)-Stirling numbers (Q790812): Difference between revisions

Let \(N(n,m,r)\) denote the number of permutations of \(\{1,\ldots,n\}\) with \(m\) cycles and such that the numbers \(1,\ldots,r\) occur in distinct cycles, and let \({\mathcal N}(n,m,r)\) denote the number of partitions of \(\{1,\ldots,n\}\) into \(m\) non-empty disjoint sets such that \(1,\ldots,r\) are in distinct subsets. These \(r\)-Stirling numbers of the first and second kind generalize the ordinary Stirling numbers which are given by \(r=1\). This paper presents a development of their properties, covering recurrence, orthogonality, generating functions and combinatorial identities. Some of the results have already been obtained from a different viewpoint by \textit{L. Carlitz} [Fibonacci Q. 18, 147--162 (1980; Zbl 0428.05003), ibid. 18, 242--257 (1980; Zbl 0441.05003)].