Name
Abstract | ||
|---|---|---|
Given R⊆N let {nk}R, [nk]R, and L(n,k)R count the number of ways of partitioning the set [n]:={1,2,…,n} into k non-empty subsets, cycles and lists, respectively, with each block having cardinality in R. We refer to these as the R-restricted Stirling numbers of the second kind, R-restricted unsigned Stirling numbers of the first kind and the R-restricted Lah numbers, respectively. Note that the classical Stirling numbers of the second kind, unsigned Stirling numbers of the first kind, and Lah numbers are {nk}={nk}N, [nk]=[nk]N and L(n,k)=L(n,k)N, respectively. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jcta.2018.08.001 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Stirling numbers,Lah numbers,Riordan matrix,Riordan group,Reversion,Lagrange inversion,Whitney numbers,Restricted partition poset | Discrete mathematics,Inverse,Combinatorics,Lah number,Matrix (mathematics),Stirling number,Stirling numbers of the second kind,Partially ordered set,Mathematics | Journal |
Volume | ISSN | Citations |
161 | 0097-3165 | 2 |
PageRank | References | Authors |
0.57 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Engbers | 1 | 21 | 6.79 |
| David Galvin | 2 | 55 | 11.59 |
| Clifford Smyth | 3 | 24 | 6.91 |