Partioning algorithms for finite sets

DOI10.1145/367651.367661MaRDI QIDQ5328436zbMATH OpenOpenAlexFDO

Authors G. A. Hutchison

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

zbMATH Keywords

numerical analysis

Cited in

(12)

• Weighted inversion numbers, restricted growth functions, and standard Young tableaux
• Order-preserving representations of the partitions on the finite set
• Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
• Restricted growth functions and incidence relations of the lattice of partitions of an n-set
• Weighted-inversion statistics and their symmetry groups
• 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
• \(q\)-Stirling numbers: a new view
• Hankel determinants of q-Stirling numbers
• Combinatorics of q, r-analogues of Stirling numbers of type B
• Whirling injections, surjections, and other functions between finite sets
• Enumeration of Equivalence Relations

This page was built for publication: Partioning algorithms for finite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5328436)