Ranking Algorithms for Lists of Partitions
From MaRDI portal
Publication:4119207
DOI10.1137/0205039zbMath0349.05004OpenAlexW2157599914MaRDI QIDQ4119207
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
Combinatorial aspects of partitions of integers (05A17) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (8)
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers ⋮ Weighted-inversion statistics and their symmetry groups ⋮ Restricted growth functions and incidence relations of the lattice of partitions of an n-set ⋮ Construction of minimal representative systems ⋮ From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns ⋮ Weighted inversion numbers, restricted growth functions, and standard Young tableaux ⋮ Ranking binary unlabelled necklaces in polynomial time
This page was built for publication: Ranking Algorithms for Lists of Partitions
