AbstractBased on finite set partitions, we introduce restrictions to the distances among the elements in each part and refine the Stirling numbers of the second kind with an extra parameter in two different ways. Combinatorial approach through distributions of “balls into boxes” is employed to establish explicit formulae
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
We present a family of regular languages representing partitions of a set N_n={1,...,n} in less or e...
AbstractNew q-analogs of Stirling numbers of the first and the second kind are derived from a poset ...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
The theory’s main theorem states that the cardinality of set parti-tions of size k on a carrier set ...
The connection between P(m, n), the number of partitions of a set containing m elements as a disjoin...
AbstractThe r-Stirling numbers of the first and second kind count restricted permutations and respec...
Bell and Stirling numbers of first and second kind tell the number of ways that n objects, or n cycl...
Educação Superior::Ciências Exatas e da Terra::MatemáticaThe Stirling numbers of the second kind, or...
AbstractMultirestricted Stirling numbers of the second kind count the number of partitions of a give...
We propose a weighting of set partitions which is analogous to the major index for permutations. The...
AbstractWe give bijections on restricted growth functions and rook placements on stairstep Ferrers b...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
AbstractBased on finite set partitions, we introduce restrictions to the distances among the element...
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
We present a family of regular languages representing partitions of a set N_n={1,...,n} in less or e...
AbstractNew q-analogs of Stirling numbers of the first and the second kind are derived from a poset ...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
Partitions of the set {1,2,...,n} are classified as having successions if a block contains con-secut...
The theory’s main theorem states that the cardinality of set parti-tions of size k on a carrier set ...
The connection between P(m, n), the number of partitions of a set containing m elements as a disjoin...
AbstractThe r-Stirling numbers of the first and second kind count restricted permutations and respec...
Bell and Stirling numbers of first and second kind tell the number of ways that n objects, or n cycl...
Educação Superior::Ciências Exatas e da Terra::MatemáticaThe Stirling numbers of the second kind, or...
AbstractMultirestricted Stirling numbers of the second kind count the number of partitions of a give...
We propose a weighting of set partitions which is analogous to the major index for permutations. The...
AbstractWe give bijections on restricted growth functions and rook placements on stairstep Ferrers b...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
AbstractBased on finite set partitions, we introduce restrictions to the distances among the element...
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set in...
We present a family of regular languages representing partitions of a set N_n={1,...,n} in less or e...
AbstractNew q-analogs of Stirling numbers of the first and the second kind are derived from a poset ...
DOI
Add to ORKG