Partioning algorithms for finite sets
From MaRDI portal
Publication:5328436
DOI10.1145/367651.367661zbMath0124.33505OpenAlexW1975349742MaRDI QIDQ5328436
Publication date: 1963
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/367651.367661
Related Items
Order-preserving representations of the partitions on the finite set, Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers, Weighted-inversion statistics and their symmetry groups, \(q\)-Stirling numbers: a new view, Restricted growth functions and incidence relations of the lattice of partitions of an n-set, Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations, From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns, Weighted inversion numbers, restricted growth functions, and standard Young tableaux
