Ranking Algorithms for Lists of Partitions

DOI10.1137/0205039MaRDI QIDQ4119207zbMATH OpenOpenAlexFDO

Authors S. Gill Williamson

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205039

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Combinatorial aspects of partitions of integers (05A17) Algorithms in computer science (68W99)

Cited in

(8)

• Weighted inversion numbers, restricted growth functions, and standard Young tableaux
• 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
• Ranking binary unlabelled necklaces in polynomial time
• From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Construction of minimal representative systems

This page was built for publication: Ranking Algorithms for Lists of Partitions

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